Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximation Algorithms for Curvature-Constrained Shortest Paths

From MaRDI portal
Publication:2706133
Jump to:navigation, search

DOI10.1137/S0097539796307790zbMath0980.68145OpenAlexW2042553152MaRDI QIDQ2706133

Hong-Yan Wang, Pankaj K. Agarwal

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539796307790


zbMATH Keywords

configuration spacemotion planningroboticsapproximation algorithms


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)


Related Items (6)

A survey of motion planning algorithms from the perspective of autonomous UAV guidance ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature ⋮ A Model for Optimal Human Navigation with Stochastic Effects ⋮ Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles ⋮ Modeling and Optimal Control of an Octopus Tentacle




This page was built for publication: Approximation Algorithms for Curvature-Constrained Shortest Paths

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2706133&oldid=15552922"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki