k-th shortest collision-free path planning

DOI10.1016/0893-9659(88)90177-2zbMath0627.90088OpenAlexW1970737314MaRDI QIDQ1092820

Yuval Lirov

Publication date: 1988

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(88)90177-2

zbMATH Keywords

hierarchical approachk-th neighborhood,k-th shortest pathk-th visibility graphshortest collision-free path construction problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Exploring collision-free path planning by using homotopy continuation methods

Cites Work

• Shortest paths in the plane with convex polygonal obstacles
• Onkth Best Policies
• Computing the extreme distances between two convex polygons

This page was built for publication: k-th shortest collision-free path planning