An efficient approach to 3D path planning

DOI10.1016/j.ins.2018.11.045zbMath1443.68165OpenAlexW2901225461MaRDI QIDQ2004715

Jihee Han

Publication date: 7 October 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.11.045

zbMATH Keywords

path planning3D environmentpoint reductionsurrounding point set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Balanced-flow algorithm for path network planning in hierarchical spaces

Cites Work

• Survey of robot 3D path planning algorithms
• Path planning on a cuboid using genetic algorithms
• Multiple UAVs path planning algorithms: a comparative study
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Distributed average tracking for multiple signals generated by linear dynamical systems: an edge-based framework

This page was built for publication: An efficient approach to 3D path planning