Path optimization with limited sensing ability

DOI10.1016/j.jcp.2015.07.037zbMath1352.65419OpenAlexW1410272359MaRDI QIDQ729301

Sung Ha Kang, Seong Jun Kim, Hao-Min Zhou

Publication date: 20 December 2016

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2015.07.037

zbMATH Keywords

path planningcomplete scanlimited coverage

Mathematics Subject Classification ID

Robot dynamics and control of rigid bodies (70E60) Finite difference methods for boundary value problems involving PDEs (65N06)

Related Items

Optimal Sensor Positioning; A Probability Perspective Study, Solving the Watchman Route Problem with Heuristic Search

Uses Software

• TSPLIB
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Visibility of point clouds and exploratory path planning in unkown environments
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Optimum watchman routes
• Optimal packing and covering in the plane are NP-complete
• Watchman routes under limited visibility
• Higher-order implicit strong numerical schemes for stochastic differential equations
• The Euclidean traveling salesman problem is NP-complete
• The traveling salesman. Computational solutions for RSP applications
• Level set methods and dynamic implicit surfaces
• Visibility and its dynamics in a PDE based implicit framework
• Shortest paths algorithms: Theory and experimental evaluation
• Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
• Visibility optimization using variational approaches
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Planning Algorithms