Static target search path planning optimization with heterogeneous agents
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4209901 (Why is no real title available?)
- scientific article; zbMATH DE number 739166 (Why is no real title available?)
- A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations
- Branch and bound methods for a search problem
- Efficient Boustrophedon multi-robot coverage: An algorithmic approach
- Route optimization for multiple searchers
- Technical Note—The Complexity of the Optimal Searcher Path Problem
Cited in
(6)- A discrete optimisation approach for target path planning whilst evading sensors
- Multi-Agent Search for a Moving and Camouflaging Target
- A hybrid multiagent approach for global trajectory optimization
- An evolutionary approach for the target search problem in uncertain environment
- 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
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)
