k-th shortest collision-free path planning

DOI10.1016/0893-9659(88)90177-2MaRDI QIDQ1092820zbMATH OpenOpenAlexFDO

Authors 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)

Review text

A hierarchical approach is formulated for the shortest collision-free path construction problem. The new concepts of k-th neighborhood, k-th visibility graph and k-th shortest path are introduced. The proposed approach generalizes some earlier algorithms and allows for incremental improvement of the planned path.

Recommendations

• Geometric k Shortest Paths
• scientific article; zbMATH DE number 1777524
• Shortest paths in the plane with obstacle violations
• Shortest paths in the plane with obstacle violations
• An algorithm for shortest-path motion in three dimensions

Cites work

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

Cited in

(3)

• Exploring collision-free path planning by using homotopy continuation methods
• Cognition of free space for planning the shortest path: A framed free space approach
• An equivalence relation for local path sets

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

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