On the public citation graph

On efficient computation of shortest Dubins paths through three consecutive points

0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-12027-0_37openalex-snapshot
An Orientation Assignment Heuristic to the Dubins Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/s12532-015-0080-8openalex-snapshot
Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm
inferredcites →https://doi.org/10.1016/j.automatica.2014.12.041openalex-snapshot
Motion planning algorithms for the Dubins Travelling Salesperson Problem
inferredcites →https://doi.org/10.1016/s0921-8890(00)00127-5openalex-snapshot
Classification of the Dubins set
inferredcites →https://doi.org/10.1073/pnas.42.10.767openalex-snapshot
DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
inferredcites →https://doi.org/10.1109/acc.2011.5991501openalex-snapshot
Algorithms for the traveling Salesman Problem with Neighborhoods involving a dubins vehicle
inferredcites →https://doi.org/10.1109/cdc.2006.376928openalex-snapshot
Receding Horizon Planning for Dubins Traveling Salesman Problems
inferredcites →https://doi.org/10.1109/cdc.2013.6760583openalex-snapshot
Shortest paths for the Dubins' vehicle in heterogeneous environments
inferredcites →https://doi.org/10.1109/cdc.2016.7799192openalex-snapshot
On efficient computation of shortest Dubins paths through three consecutive points
inferredcites →https://doi.org/10.1109/iros.2013.6696904openalex-snapshot
Efficient target visiting path planning for multiple vehicles with bounded curvature
inferredcites →https://doi.org/10.1109/iros.2015.7353945openalex-snapshot
On the Dubins Traveling Salesman Problem with Neighborhoods
inferredcites →https://doi.org/10.1109/jproc.2011.2158181openalex-snapshot
Dynamic Vehicle Routing for Robotic Systems
inferredcites →https://doi.org/10.1109/tac.2008.925814openalex-snapshot
Traveling Salesperson Problems for the Dubins Vehicle
inferredcites →https://doi.org/10.1109/tac.2011.2166311openalex-snapshot
On the Dubins Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/tase.2006.872110openalex-snapshot
A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints
inferredcites →https://doi.org/10.1109/tro.2005.847567openalex-snapshot
Motion planning for multitarget surveillance with mobile sensor agents
inferredcites →https://doi.org/10.1137/100816079openalex-snapshot
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
inferredcites →https://doi.org/10.1142/s2301385014500022openalex-snapshot
Integrating Task and Motion Planning for Unmanned Aerial Vehicles
inferredcites →https://doi.org/10.2307/2372560openalex-snapshot
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-19-6613-2_55openalex-snapshot
Efficient Path Generation Method for Unmanned Aerial Vehicle via Multiple Waypoints
inferred← citeshttps://doi.org/10.1007/s10846-016-0459-4openalex-snapshot
Tightly Bounding the Shortest Dubins Paths Through a Sequence of Points
inferred← citeshttps://doi.org/10.1007/s11804-025-00759-5openalex-snapshot
Quality-guaranteed Dubins Path Planning for USV Based on Mixed-integer Piecewise-linear Programming for Addressing the Extended Minimum-time Intercept Problem
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.04.007openalex-snapshot
Shortest Dubins paths through three points
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.108996openalex-snapshot
On Dubins paths to a circle
inferred← citeshttps://doi.org/10.1109/icuas.2017.7991396openalex-snapshot
Optimizing multiple UAV cooperative ground attack missions
inferred← citeshttps://doi.org/10.1109/icuas48674.2020.9214023openalex-snapshot
Intercepting a Target Moving on a Racetrack Path
inferred← citeshttps://doi.org/10.1109/lcsys.2025.3582622openalex-snapshot
Dubins Path With Terminal Range and Field-of-View Constraints
inferred← citeshttps://doi.org/10.1109/lra.2025.3540531openalex-snapshot
Fast Shortest Path Polyline Smoothing With $G^{1}$ Continuity and Bounded Curvature
inferred← citeshttps://doi.org/10.1109/lra.2026.3665070openalex-snapshot
ReloPush-BOSS: Optimization-Guided Nonmonotone Rearrangement Planning for a Car-Like Robot Pusher
inferred← citeshttps://doi.org/10.1109/med.2019.8798576openalex-snapshot
A low-complexity algorithm for shortest Dubins paths with intermediate via points
inferred← citeshttps://doi.org/10.1109/med.2019.8798584openalex-snapshot
Relaxed Dubins Problems through Three Points
inferred← citeshttps://doi.org/10.1109/tits.2025.3606479openalex-snapshot
A Unified and Quality-Guaranteed Approach for Dubins Vehicle Path Planning With Obstacle Avoidance and Curvature Constraint
inferred← citeshttps://doi.org/10.1631/fitee.2000041openalex-snapshot
A descent method for the Dubins traveling salesman problem with neighborhoods
inferred← citeshttps://doi.org/10.23919/acc.2019.8814913openalex-snapshot
Optimal Dubins Paths to Intercept a Moving Target on a Circle
inferred← citeshttps://doi.org/10.2514/6.2022-1086openalex-snapshot
Shortest Bounded Curvature Trajectory Via A Moving Circle: Theory and Applications
inferred← citeshttps://doi.org/10.3390/a17080350openalex-snapshot
A Non-Smooth Numerical Optimization Approach to the Three-Point Dubins Problem (3PDP)
inferred← citeshttps://doi.org/10.3390/machines12090659openalex-snapshot
Classification Scheme for the Three-Point Dubins Problem
inferred← citeshttps://doi.org/10.3390/sym17122133openalex-snapshot
A Machine Learning Approach for the Three-Point Dubins Problem (3PDP)
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02676openalex-snapshot
Optimal Target Intercept Paths for Vehicles with Turn Radius Constraints
showing the first 20 of 21 · page through all 21
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.