A^* algorithm based on direction constraints

DOI10.13195/J.KZYJC.2016.1134MaRDI QIDQ4643097zbMATH OpenFDO

Authors

Publication date 25 May 2018

Full work available at URL https://doi.org/10.13195/J.KZYJC.2016.1134

zbMATH Keywords

\({\text A}^*\) algorithmangle constraintpath searchturning constraint

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Programming involving graphs or networks (90C35)

Recommendations

• Mobile robot optimal path planning based on smoothing of the A^* algorithm
• Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints
• An improved path planning algorithm based on RRT-ConCon
• A study of improvement of D^* algorithms for mobile robot path planning in partial unknown environments
• Theta^*: any-angle path planning on grids

Cited in

(1)

• Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints

This page was built for publication: \({\text A}^*\) algorithm based on direction constraints

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