Static target search path planning optimization with heterogeneous agents

DOI10.1007/S10479-016-2145-0zbMATH Open1357.90093OpenAlexW2330511976MaRDI QIDQ512934FDOQ512934

Authors: Jean Berger, Nassirou Lo, Mohamed Barkaoui 

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2145-0

Recommendations

• An innovative multi-agent search-and-rescue path planning approach
• An information theoretic based integer linear programming approach for the discrete search path planning problem
• An optimal path planning problem for heterogeneous multi-vehicle systems
• Route optimization for multiple searchers
• Using multiple searchers in constrained-path, moving-target search problems

zbMATH Keywords

linear programmingheterogeneous agentssearch and rescuesearch path planningquadratic programmimng

Mathematics Subject Classification ID

Quadratic programming (90C20) Applications of mathematical programming (90C90) Integer programming (90C10)

Cites Work

• Route optimization for multiple searchers
• Title not available (Why is that?)
• Efficient Boustrophedon multi-robot coverage: An algorithmic approach
• Branch and bound methods for a search problem
• Title not available (Why is that?)
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations

Cited In (2)

• A hybrid multiagent approach for global trajectory optimization
• An evolutionary approach for the target search problem in uncertain environment

Uses Software

• CPLEX

This page was built for publication: Static target search path planning optimization with heterogeneous agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512934)