Path planning with objectives minimum length and maximum clearance

DOI10.1007/978-3-030-57852-7_8OpenAlexW3082852176MaRDI QIDQ1997271

Arman Rouhani, Maryam Sanisales, Mansoor Davoodi

Publication date: 1 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57852-7_8

zbMATH Keywords

shortest pathapproximation algorithmPareto optimalitypath planningbi-objective optimizationclearance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)

Related Items (1)

Path planning in a weighted planar subdivision under the Manhattan metric

Cites Work

• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• Computing isogenies between Montgomery curves using the action of \((0,0)\)
• The Arithmetic of Elliptic Curves
• Random forests
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Path planning with objectives minimum length and maximum clearance