pith. sign in

arxiv: 1907.07825 · v1 · pith:FSEKZXTPnew · submitted 2019-07-18 · 💻 cs.RO · cs.SY· eess.SY· math.OC

Search-Based Motion Planning for Performance Autonomous Driving

Zlatan Ajanovic , Enrico Regolin , Georg Stettinger , Martin Horn , Antonella Ferrara This is my paper

Pith reviewed 2026-05-24 20:08 UTC · model grok-4.3

classification 💻 cs.RO cs.SYeess.SYmath.OC
keywords search-based motion planningautonomous drivingnonlinear vehicle dynamicstrajectory optimizationlap time minimizationperformance drivingreference trajectoriesslippery road conditions
0
0 comments X

The pith

Search-based motion planning generates time-optimal trajectories for autonomous cars by directly incorporating nonlinear vehicle dynamics and state/input constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper demonstrates that search-based planning produces reference trajectories aimed at minimum lap time on slippery roads. It achieves this by using the full nonlinear vehicle model instead of simplified approximations and by enforcing constraints during the search. A sympathetic reader would see value in this because performance driving at the friction limits demands accurate prediction of future states to remain safe while minimizing time. Evaluation occurs through simulation on a track containing segments of varying curvature. The central mechanism is the explicit search over feasible trajectories under those dynamics.

Core claim

The search-based approach enables to explicitly consider a nonlinear vehicle dynamics model as well as constraints on states and inputs so that even challenging scenarios can be achieved in a safe and optimal way, with the goal to achieve the minimum lap time on slippery roads. The algorithm performance is evaluated in simulated driving on a track with segments of different curvatures.

What carries the argument

Search-based motion planning that explores sequences of vehicle states under the nonlinear dynamics model to locate minimum-time feasible trajectories.

If this is right

  • Autonomous vehicles can execute tighter, time-optimal paths through high-curvature slippery sections without unsafe approximations.
  • Explicit constraint handling during search prevents state or input limit breaches that could cause loss of control.
  • Reference trajectories become available for tracking controllers that must operate at the vehicle dynamics limits.
  • The same planner structure supports different track geometries by changing only the curvature profile fed to the search.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The method could be tested against model-predictive control baselines to quantify any gains in global optimality for the same nonlinear model.
  • Real-world transfer would require adding uncertainty handling for tire-road friction estimates that vary along the track.
  • The search formulation may generalize to other minimum-time control tasks with nonlinear dynamics, such as robotic arm trajectories under torque limits.

Load-bearing premise

That the search procedure can locate time-optimal trajectories fast enough to support real-time or near-real-time control on a physical vehicle.

What would settle it

A timing or lap-time measurement in the simulated track environment showing either that the planner exceeds available computation time or that the generated trajectories produce higher lap times or constraint violations than a known reference optimum.

Figures

Figures reproduced from arXiv: 1907.07825 by Antonella Ferrara, Enrico Regolin, Georg Stettinger, Martin Horn, Zlatan Ajanovic.

Figure 1
Figure 1. Figure 1: Equilibrium points sets Sss (and linear interpolation) in the v, β, ψ˙ space for counter￾clockwise cornering maneuvers with different curvature radii Rc. where µ is the friction coefficient, λ and α the longitudinal and lateral slips respectively. The nonlinear friction functions take the form of the Magic Formula (MF) tire friction model, with an isotropic friction model being used for simplicity. This re… view at source ↗
Figure 2
Figure 2. Figure 2: ESM for the inputs δ (left) and λ (right), counter-clockwise maneuvers. The highlighted portion of the β − ψ˙ plane corresponds to the one in which the bicycle model representation is considered valid. The intervals of values [δmin,δmax], [λmin,λmax] are used for the bicycle-model expansion explained in Section 3.1. Let us assume that the tire-road contact model and the vehicle model (2)-(5) are correct, a… view at source ↗
Figure 3
Figure 3. Figure 3: (a) β −ψ˙ map representing the expansion modes depending on initial states. (b) Expanding parent node n to different child nodes n ′ on the ESM. before, child nodes (motion primitives) are generated based on two models, bicycle model for a close-to-straight driving and vehicle-equilibrium-states during cornering. During cornering, the child nodes (motion primitives) are generated based on the steady state … view at source ↗
Figure 4
Figure 4. Figure 4: Graphical representation of the trajectories exploration in U-turn (left) and wide turn (right). wheel angle δ and the rear wheels slip λ are varied within the ranges defined by |β|<βlin and |ψ˙|<ψ˙lin in the equilibrium surfaces in [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Dynamical states and trajectory evolution over the full test-circuit. step the trajectory ’dangerously’ approaches the side of the road, in the next two steps the trajectory is incrementally regularized, thanks to the fact that the exploration of such portion of the track is now being evaluated in earlier nodes. The dynamical states, which represent the output of the trajectory generation, are de￾picted in… view at source ↗
read the original abstract

Driving on the limits of vehicle dynamics requires predictive planning of future vehicle states. In this work, a search-based motion planning is used to generate suitable reference trajectories of dynamic vehicle states with the goal to achieve the minimum lap time on slippery roads. The search-based approach enables to explicitly consider a nonlinear vehicle dynamics model as well as constraints on states and inputs so that even challenging scenarios can be achieved in a safe and optimal way. The algorithm performance is evaluated in simulated driving on a track with segments of different curvatures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The paper claims to use a search-based motion planning algorithm to generate reference trajectories for dynamic vehicle states aimed at achieving minimum lap time on slippery roads. It emphasizes the ability to explicitly consider nonlinear vehicle dynamics and constraints on states and inputs for safe and optimal performance in challenging scenarios, with evaluation via simulation on a track featuring segments of different curvatures.

Significance. If the method is shown to work as claimed, it would be significant for the field of autonomous driving by providing a planning approach that handles nonlinear dynamics and constraints explicitly, potentially enabling better performance in limit-handling situations. The simulation-based evaluation on varying curvatures suggests applicability to real-world tracks.

major comments (1)
  1. Evaluation section: the simulation results provide no quantitative metrics, error analysis, baseline comparisons with other planners, or implementation details (e.g., search parameters, discretization, or timing), which is load-bearing for the central claim that the approach achieves safe and optimal trajectories under nonlinear dynamics and constraints.
minor comments (1)
  1. Abstract: the phrasing 'enables to explicitly consider' is grammatically awkward and should be revised for clarity.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback and positive view on the potential significance of the work. We address the single major comment below.

read point-by-point responses

  1. Referee: Evaluation section: the simulation results provide no quantitative metrics, error analysis, baseline comparisons with other planners, or implementation details (e.g., search parameters, discretization, or timing), which is load-bearing for the central claim that the approach achieves safe and optimal trajectories under nonlinear dynamics and constraints.

    Authors: We agree that the evaluation, as presented, relies on a qualitative description of simulated driving on a track with segments of varying curvature and does not include the requested quantitative elements. This limits the strength of the claims regarding optimality and constraint handling. In the revised manuscript we will expand the evaluation section to report quantitative metrics such as achieved lap times, constraint violation rates, and trajectory tracking errors; include a baseline comparison against at least one alternative planner; and provide implementation details including search parameters, state/input discretization, and measured computation times. These additions will be supported by additional simulation runs on the same track. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper describes a search-based motion planning algorithm that explicitly incorporates a nonlinear vehicle dynamics model and state/input constraints to generate minimum-lap-time trajectories on slippery roads, evaluated via simulation. No equations, fitted parameters, predictions, or self-citations are presented in the abstract or description that reduce any claimed result to its own inputs by construction. The central claim is an algorithmic capability (explicit handling of nonlinear dynamics within a search framework), which stands as an independent engineering contribution without self-definitional, fitted-input, or uniqueness-imported circularity patterns. This is the expected non-finding for an applied planning paper whose soundness rests on simulation verification rather than internal derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no free parameters, axioms, or invented entities are stated or can be inferred.

pith-pipeline@v0.9.0 · 5621 in / 936 out tokens · 16827 ms · 2026-05-24T20:08:28.517391+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Optimization-ba sed autonomous racing of 1:43 scale rc cars,

    A. Liniger, A. Domahidi, and M. Morari, “Optimization-ba sed autonomous racing of 1:43 scale rc cars,” Optimal Control Applications and Methods, vol. 36, no. 5, pp. 628–647, 2015

    work page 2015

  2. [2]

    A noncooperative game approac h to autonomous racing,

    A. Liniger and J. Lygeros, “A noncooperative game approac h to autonomous racing,” IEEE Transactions on Control Systems Technology, pp. 1–14, 2019

    work page 2019

  3. [3]

    A probabilistic approach to mixed open-loop and closed-loop control, with applicationto extreme autonomous driving,

    J. Z. Kolter, C. Plagemann, D. T. Jackson, A. Y . Ng, and S. Thrun, “A probabilistic approach to mixed open-loop and closed-loop control, with applicationto extreme autonomous driving,” in 2010 IEEE International Conference on Robotics and Automation. IEEE, 2010, pp. 839–845

    work page 2010

  4. [4]

    Modeling aggressive m aneuvers on loose surfaces: The cases of trail-braking and pendulum-turn,

    E. V elenis, P . Tsiotras, and J. Lu, “Modeling aggressive m aneuvers on loose surfaces: The cases of trail-braking and pendulum-turn,” in ECC. New Y ork: IEEE, 2015, pp. 1233–1240

    work page 2015

  5. [5]

    Optimality properties and driver input parameteriz ation for trail-braking cornering,

    ——, “Optimality properties and driver input parameteriz ation for trail-braking cornering,” European Journal of Control, vol. 14, no. 4, pp. 308–320, 2008

    work page 2008

  6. [6]

    Minimum time cornering: the effect of road surface and car transmission l ayout,

    D. Tavernini, M. Massaro, E. V elenis, D. I. Katzourakis, a nd R. Lot, “Minimum time cornering: the effect of road surface and car transmission l ayout,” V ehicle System Dynamics, vol. 51, no. 10, pp. 1533–1547, 2013

    work page 2013

  7. [7]

    Real-time trail-braking maneuve r generation for off-road vehicle racing,

    C. Y ou and P . Tsiotras, “Real-time trail-braking maneuve r generation for off-road vehicle racing,” in 2018 Annual American Control Conference (ACC). IEEE, 2018, pp. 4751–4756

    work page 2018

  8. [8]

    Dri ft control for cornering maneuver of autonomous vehicles,

    F. Zhang, J. Gonzales, S. E. Li, F. Borrelli, and K. Li, “Dri ft control for cornering maneuver of autonomous vehicles,” Mechatronics, vol. 54, pp. 167–174, 2018

    work page 2018

  9. [9]

    Information theoretic mpc for model-based reinforcement learning,

    G. Williams, N. Wagener, B. Goldfain, P . Drews, J. M. Rehg, B. Boots, and E. A. Theodorou, “Information theoretic mpc for model-based reinforcement learning,” in 2017 IEEE International Conference on Robotics and Automation (ICRA), May 2017, pp. 1714–1721

    work page 2017

  10. [10]

    Search-based optimal motion planning for automated driving,

    Z. Ajanovic, B. Lacevic, B. Shyrokau, M. Stolz, and M. Hor n, “Search-based optimal motion planning for automated driving,” in 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2018, pp. 4523–4530

    work page 2018

  11. [11]

    Motion planning in complex environments using closed-loop prediction,

    Y . Kuwata, J. Teo, S. Karaman, G. Fiore, E. Frazzoli, and J . How, “Motion planning in complex environments using closed-loop prediction,” in AIAA Guidance, Navigation and Control Conference and Exhibit, 2008, p. 7166

    work page 2008

  12. [12]

    A multi-rate is m approach for robust vehicle stability control during cornering,

    E. Regolin, M. Zambelli, and A. Ferrara, “A multi-rate is m approach for robust vehicle stability control during cornering,” IF AC-PapersOnLine, vol. 51, no. 9, pp. 249–254, 2018

    work page 2018

  13. [13]

    A sliding mode virtual sensor for wheel forces estimation wit h accuracy enhancement via ekf,

    E. Regolin, A. G. A. V azquez, M. Zambelli, A. Victorino, A . Charara, and A. Ferrara, “A sliding mode virtual sensor for wheel forces estimation wit h accuracy enhancement via ekf,” IEEE Transactions on V ehicular Technology, vol. 68, no. 4, pp. 3457 – 3471, Apr. 2019. NOTICE: this is the authors’ version of the work that was acce pted for publication in...

    work page 2019

  14. [14]

    Genta, Motor vehicle dynamics: modeling and simulation

    G. Genta, Motor vehicle dynamics: modeling and simulation. World Scientific, 1997, vol. 43

    work page 1997

  15. [15]

    Steady-state drifting stabi- lization of rwd vehicles,

    E. V elenis, D. Katzourakis, E. Frazzoli, P . Tsiotras, and R. Happee, “Steady-state drifting stabi- lization of rwd vehicles,”Control Engineering Practice, vol. 19, no. 11, pp. 1363–1376, 2011

    work page 2011

  16. [16]

    Pacejka, Tire and V ehicle Dynamics

    H. Pacejka, Tire and V ehicle Dynamics. Butterworth-Heinemann, 2012

    work page 2012

  17. [17]

    Optimal trajectories for time-critical street scenarios using discretized terminal manifolds,

    M. Werling, S. Kammel, J. Ziegler, and L. Gröll, “Optimal trajectories for time-critical street scenarios using discretized terminal manifolds,” The International Journal of Robotics Research, vol. 31, no. 3, pp. 346–359, 2012

    work page 2012

  18. [18]

    A formal basis for th e heuristic determination of mini- mum cost paths,

    P . Hart, N. Nilsson, and B. Raphael, “A formal basis for th e heuristic determination of mini- mum cost paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, 1968

    work page 1968

  19. [19]

    Junior: The stanford entry in the u rban challenge,

    M. Montemerlo et al., “Junior: The stanford entry in the u rban challenge,” Journal of Field Robotics, vol. 25, no. 9, pp. 569–597, 2008

    work page 2008

  20. [20]

    Trajecto ry planning for bertha — a local, continuous method,

    J. Ziegler, P . Bender, T. Dang, and C. Stiller, “Trajecto ry planning for bertha — a local, continuous method,” in 2014 IEEE Intelligent V ehicles Symposium Proceedings . IEEE, 6/8/2014 - 6/11/2014, pp. 450–457

    work page 2014