Motion planning for multitarget surveillance with mobile sensor agents
- 26 September 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 21 (5), 898-908
- https://doi.org/10.1109/tro.2005.847567
Abstract
In the surveillance of multiple targets by mobile sensor agents (MSAs), system performance relies greatly on the motion-control strategy of the MSAs. This paper investigates the motion-planning problem for a limited resource of M MSAs in an environment of N targets (M<N). The kinematics of the MSA is modeled as a point mass moving at a constant speed with a bounded turning radius. Based on the fact that the track information of each target degrades over time, the motion-planning problem is formulated as an optimization problem whose objective is to minimize the average time duration between two consecutive observations of each target. In the case of a single MSA, the motion-planning problem is further interpreted so as to find a time-optimal loop path to traverse the targets. A gradient-approximation algorithm is then proposed to generate a suboptimal loop path for a mobile agent to traverse a sequence of target points. For the multi-MSA-multitarget case, a cooperative online motion-planning approach is developed.Keywords
This publication has 37 references indexed in Scilit:
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- Evolutionary algorithm based offline/online path planner for uav navigationIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2003
- Coordinated target assignment and intercept for unmanned air vehiclesIEEE Transactions on Robotics and Automation, 2002
- Aerial video surveillance and exploitationProceedings of the IEEE, 2001
- On optimal cooperative conflict resolution for air traffic management systemsIEEE Transactions on Intelligent Transportation Systems, 2000
- Time-optimal impact angle control for vertical plane engagementsIEEE Transactions on Aerospace and Electronic Systems, 1999
- Optimal motion planning for multiple robots having independent goalsIEEE Transactions on Robotics and Automation, 1998
- Shortest paths synthesis for a car-like robotIEEE Transactions on Automatic Control, 1996
- An efficient algorithm to find a shortest path for a car-like robotIEEE Transactions on Robotics and Automation, 1995
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and TangentsAmerican Journal of Mathematics, 1957