Bi-objective data gathering path planning for vehicles with bounded curvature
From MaRDI portal
Publication:1652333
DOI10.1016/j.cor.2016.07.004zbMath1391.90681OpenAlexW2485064764MaRDI QIDQ1652333
Mario F. M. Campos, Jefferson W. G. Monteiro, Douglas G. Macharet, Geraldo Robson Mateus
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.004
Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Approximation algorithms for the Geometric Covering Salesman Problem
- Discrete optimization methods to determine trajectories for Dubins' vehicles
- Robotic data mules for collecting data over sparse sensor fields
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- Approximation algorithms for TSP with neighborhoods in the plane
- Classification of the Dubins set
- Traveling Salesperson Problems for the Dubins Vehicle
- Planning Algorithms
- Technical Note—Bounds for the Travelling-Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
