An innovative multi-agent search-and-rescue path planning approach

DOI10.1016/j.cor.2014.06.016zbMath1348.90346OpenAlexW2047599849MaRDI QIDQ337250

Jean Berger, Nassirou Lo

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.016

zbMATH Keywords

linear programmingmulti-agentsearch and rescuesearch path planning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Search theory (90B40)

Related Items (5)

Trajectory optimization under kinematical constraints for moving target search ⋮ A mobile multi-agent sensing problem with submodular functions under a partition matroid ⋮ Improved Glasius bio-inspired neural network for target search by multi-agents ⋮ Consensus of multi-agent systems with heterogeneous unknown nonlinear switching dynamics: a dwelling time approach ⋮ Ant colony optimization for path planning in search and rescue operations

Uses Software

• CPLEX

Cites Work

• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• Route optimization for multiple searchers
• Branch and bound methods for a search problem
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: An innovative multi-agent search-and-rescue path planning approach