Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D

DOI10.1007/S10878-024-01148-4MaRDI QIDQ6645154

Phan Thanh An, Nguyen Thi Le

Publication date: 28 November 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

shortest pathmultiple shootingautonomous robotsequence of line segments

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets
• Direct multiple shooting method for solving approximate shortest path problems
• Euclidean shortest paths in the presence of rectilinear barriers

This page was built for publication: Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D

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