Abstract
In this paper, we address the multi pursuer version of the pursuit evasion problem in polygonal environments. By discretizing the problem, and applying a Mixed Integer Linear Programming (MILP) framework, we are able to address problems requiring so-called recontamination and also impose additional constraints, such as connectivity between the pursuers. The proposed MILP formulation is less conservative than solutions based on graph discretizations of the environment, but still somewhat more conservative than the original underlying problem. It is well known that MILPs, as well as multi pursuer pursuit evasion problems, are NP-hard. Therefore we apply an iterative Receding Horizon Control (RHC) scheme where a number of smaller MILPs are solved over shorter planning horizons. The proposed approach is implemented in Matlab/Cplex and illustrated by a number of solved examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anisi, D., Ögren, P., & Hu, X. (2010). Cooperative minimum time surveillance with multiple ground vehicles. IEEE Transactions on Automatic Control, 55. doi:10.1109/TAC.2010.2047438.
Bellingham, J., Richards, A., & How, J. (2002). Receding horizon control of autonomous aerial vehicles. In American Control Conference: Vol. 5 (pp. 3741–3746). New York: IEEE Press.
CPLEX, I. (2007). 10.2 user’s manual. ILOG Inc., Gentilly.
Gerkey, B., Thrun, S., & Gordon, G. (2006). Visibility-based pursuit-evasion with limited field of view. The International Journal of Robotics Research, 25(4), 299.
Guibas, L., Latombe, J., LaValle, S., Lin, D., & Motwani, R. (1999). A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications, 9, 471–493.
Hollinger, G., Singh, S., & Kehagias, A. (2009). Efficient, guaranteed search with multi-agent teams. In 2009 Robotics: science and systems conference, RSS
Hollinger, G., Singh, S., & Kehagias, A. (2010). Improving the efficiency of clearing with multi-agent teams. The International Journal of Robotics Research, 29(8), 1088–1105.
Isler, V., Kannan, S., & Khanna, S. (2005). Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics, 21(5), 875–884.
Jung, B., & Sukhatme, G. (2002). Tracking targets using multiple robots: the effect of environment occlusion. Autonomous Robots, 13(3), 191–205.
Kolling, A., & Carpin, S. (2007). The GRAPH-CLEAR problem: definition, theoretical properties and its connections to multirobot aided surveillance. In Proceedings of the IEEE/RSJ international conference on intelligent robots and systems (pp. 1003–1008).
LaValle, S., & Hinrichsen, J. (2002). Visibility-based pursuit-evasion: The case of curved environments. IEEE Transactions on Robotics and Automation, 17(2), 196–202.
Lindhe, M., & Johansson, K. (2008). Communication-aware trajectory tracking. In IEEE international conference on robotics and automation, ICRA (pp. 1519–1524).
Schouwenaars, T., De Moor, B., Feron, E., & How, J. (2001). Mixed integer programming for multi-vehicle path planning. In European control conference (pp. 2603–2608).
Simov, B., Slutzki, G., & LaValle, S. (2009). Clearing a polygon with two 1-searchers. International Journal of Computational Geometry and Applications, 19(1), 59–92.
Suzuki, I., & Yamashita, M. (1992). Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21, 863.
Thunberg, J., & Ögren, P. (2010). An iterative Mixed Integer Linear Programming approach to pursuit evasion problems in polygonal environments. In IEEE international conference on robotics and automation (ICRA) (pp. 5498–5503). New York: IEEE Press.
Tovar, B., & LaValle, S. (2008). Visibility-based pursuit-evasion with bounded speed. In Algorithmic foundation of robotics VII (pp. 475–489). Berlin: Springer.
Urrutia, J. (2000). Art gallery and illumination problems. In Handbook of computational geometry (pp. 973–1027).
Yu, J., & LaValle, S. (2008). Tracking hidden agents through shadow information spaces. In IEEE international conference on IEEE robotics and automation, ICRA 2008 (pp. 2331–2338). New York: IEEE Press.
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author would like to gratefully acknowledge the financial support by the Swedish National Space Technology Research Programme (NRFP).
Rights and permissions
About this article
Cite this article
Thunberg, J., Ögren, P. A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints. Auton Robot 31, 333–343 (2011). https://doi.org/10.1007/s10514-011-9247-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10514-011-9247-y