Path planning with objectives minimum length and maximum clearance

DOI10.1007/978-3-030-57852-7_8MaRDI QIDQ1997271zbMATH OpenOpenAlexFDO

Authors Mansoor Davoodi, Arman Rouhani, Maryam Sanisales

Publication date 1 March 2021

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

zbMATH Keywords

approximation algorithmbi-objective optimizationclearancePareto optimalitypath planningshortest path

Mathematics Subject Classification ID

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

Cites work

• Computing isogenies between Montgomery curves using the action of (0,0)
• Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• scientific article; zbMATH DE number 706265 (Why is no real title available?)
• scientific article; zbMATH DE number 3356934 (Why is no real title available?)
• Random forests
• The Arithmetic of Elliptic Curves

Cited in

(1)

• Path planning in a weighted planar subdivision under the Manhattan metric

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

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