Abstract
As discrete multi-agent static open-loop target search path planning known to be computationally hard recently proved to be solvable in practice in the homogeneous case, its heterogeneous problem counterpart still remains very difficult. The heterogeneous problem introduces broken symmetry reflected by dissimilar sensing ability/capacity, agent capability and relative velocity and, is further exacerbated when operating under near real-time problem-solving constraints, as key decision variables grow exponentially in the number of agents. Departing from the homogeneous agent model already published, new integer linear and quadratic programming formulations are proposed to reduce computational complexity and near-optimally solve the discrete static search path planning problem involving heterogeneous agents. The novelty consists in taking advantage of typical optimal path solution property to derive new tractable problem models. At the expense of a slightly accrued computational complexity, the proposed quadratic integer program formulation conveys considerable benefit by keeping key decision variables linear in the number of agents. The convexity property of its defined objective function further allows ensuring global optimality when a local optimum is computed. Special agent network representations capturing individual agent decision moves are also devised to simplify problem modeling and expedite constraint modeling specification. As a result, cost-effective quadratic program implementation for realistic problems may be achieved to rapidly compute near-optimal solutions, while providing a robust bound on solution quality through Lagrangian relaxation.
Similar content being viewed by others
References
Abi-Zeid, I., Nilo, O., & Lamontagne, L. (2011). Constraint optimization approach for the allocation of multiple search units in search and rescue operations. INFOR: Information Systems and Operational Research, 49(1 / 2), 15–30.
Benkoski, S., Monticino, M., & Weisinger, J. (1991). A survey of the search theory literature. Naval Research Logistics, 38, 469–494.
Choo, C., Smith, J., & Nasrabadi, N. (1991). An efficient terrain acquisition algorithm for a mobile robot, In Proceedings of the IEEE international conference robotics and automation, Sacramento, CA (pp. 306–311).
Chung, T. H., & Burdick, J. (2012). Analysis of search decision making using probabilistic search strategies. IEEE Transactions on Robotics, 28(10), 132–144.
Chung, T., Hollinger, G., & Isler, V. (2011). Search and pursuit-evasion in mobile robotics: A survey. Autonomous Robots (AURO), 31(4), 299–316.
Hohzaki, R., & Iida, K. (1995). Optimal search plan for a moving target when a search path is given. Mathematica Japonica, 41(1), 175–184.
Hollinger, G.A. (2010). Search in the Physical World. CMU-RI-TR-10-20, Robotics Institute, PhD thesis, Carnegie Mellon University.
Hollinger, G. A., & Singh, S. (2010). GSST: Anytime guaranteed search with spanning trees. Autonomous Robots, 29(1), 99–118.
IBM, ILOG CPLEX (2009). Optimizer, Available: http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio/cplex-optimizer/cplex-performance/ and IBM ILOG CPLEX V12.1. ftp://public.dhe.ibm.com/software/websphere/ilog/docs/optimization/cplex/ps_usrmancplex.pdf
Jin, Y., Liao, Y., Minai, A., & Polycarpou, M. (2006). Balancing search and target response in cooperative unmanned aerial vehicle (UAV) Teams. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions, 36(3), 571–587.
Latombe, J.-C. (1991). Robot motion planning, ser. International series in engineering and computer science; Robotics: vision, manipulation and sensors (Vol. 124). Boston: Kluwer Academic Publishers.
Lau, H. (2007). Optimal search in structured environments, PhD Thesis, University of Technology, Sydney.
Lau, H., & Dissanayake, G. (2005). Optimal search for multiple targets in a built environment, In Proceedings of the IEEE/RSJ international conference intelligent robots and systems, Edmonton, Alberta, Canada (pp. 228–233).
Lau, H., & Dissanayake, G. (2006). Probabilistic search for a moving target in an indoor environment, In Proceedings of the IEEE/RSJ international conference intelligent robots and systems (pp. 3393–3398).
Lo, N., Berger, J., & Noel, M. (July 2012). Toward Optimizing Static Target Search Path Planning, In Proceedings of the 5th IEEE symposium on computational intelligence for security and defence applications, Ottawa, Canada.
Morin, M., et al. (2009). The optimal searcher path problem with a visibility criterion in discrete time and space. In International conference on information fusion, Seatle, USA.
Morin, M., Papillon, A.P., Laviolette, F., Abi-Zeid, I., & Quimper, C.G. (2012). Constraint Programming for Path Planning with Uncertainty: Solving the Optimal Search Path problem, In Proceedings of the 18th conference on principles and practice of constraint programming, Québec, Qc, Canada (pp. 988–1003).
Rekleitis, I., et al. (2008). Efficient boustrophedon multi-robot coverage: An algorithmic approach. Annals of Mathematics and Artificial Intelligence, 52, 109–142.
Royset, J. O., & Sato, H. (2010). Route Optimization for Multiple Searchers. Naval Research Logistics, 57(8), 701–717.
Sankaranarayanan, A., & Masuda, I. (1992). Sensor based terrain acquisition: A new, hierarchical algorithm and a basic theory, In Proceedings of the IEEE/RSJ international conference intelligent robots and systems, Raleigh (pp. 1515–1523).
Stone, L. D. (2007). Theory of optimal search, 2nd ed., Topics in Operations Research Series., INFORMS.
Svennebring, J., & Koenig, S. (2004). Building terrain-covering ant robots: A feasibility study. Autonomous Robots, 16(3), 313–332.
Trummel, K. E., & Weisinger, J. R. (1986). The complexity of the optimal searcher path problem. Operations Research, 34(2), 324–327.
Wagner, W., et al. (1999). Distributed covering by ant-robots using evaporating traces. Robotics and Automation, IEEE Transactions, 15(5), 918–933.
Washburn, A. R. (1998). Branch and bound methods for a search problem. Naval Research Logistics, 45, 243–257.
Wong, S., & MacDonald, B. (2003). A topological coverage algorithm for mobile robots, In Proceedings of the IEEE/RSJ international conference intelligent robots and systems, Las Vegas (pp. 1685–1690).
Yang, S., & Luo, C. (2004). A neural network approach to complete coverage path planning. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions, 34(1), 718–724.
Acknowledgments
The reported work was co-funded by Defence Research and Development Canada Valcartier and T-OptLogic Ltd, Quebec City, Canada. The authors would like to thank anonymous reviewers who provided critical reviews to improve content presentation and readability of the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Berger, J., Lo, N. & Barkaoui, M. Static target search path planning optimization with heterogeneous agents. Ann Oper Res 244, 295–312 (2016). https://doi.org/10.1007/s10479-016-2145-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-016-2145-0