Abstract In this paper, we study the recently introduced time-constrained maximal covering routing problem. problem, are given a central depot, set of facilities, and customers. Each customer is associated with subset facilities which can cover it. A feasible solution consists k Hamiltonian cycles on subsets depot. cycle must contain depot respect distance limit. The goal to maximize number cus...

Support for Resource Constrained Microcontroller Programming by a Broad Developer Community

For a constrained optimal impulse control problem of an abstract dynamical system, we introduce the occupation measures along with aggregated and present two associated linear programs. We prove that programs are equivalent under appropriate conditions, each program gives rise to strategy in original problem. In particular, show absence relaxation gap. By means example, also detailed comparison...

Most mobile robots follow a modular sense-plan-act system architecture that can lead to poor performance or even catastrophic failure for visual inertial navigation systems due trajectories devoid of feature matches. Planning in belief space provides unified approach tightly couple the perception, planning and control modules, leading are robust noisy measurements disturbances. However, existin...