Pith. sign in

REVIEW 2 major objections 4 minor 168 references

Principles of Robot Autonomy

T0 review · 2 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This book claims the whole of robot autonomy—classical and learned—fits one See-Think-Act loop, and organizes itself around proving that claim stage by stage.

desk verdict A solid, carefully built robotics textbook whose main risk is an over-claimed organizing framework, not a research result. read the letter →

arxiv 2608.03496 v1 pith:RQT7I5O2 submitted 2026-08-04 cs.RO cs.AIcs.CVcs.SYeess.SY

Daniele Gammelli , Joseph Lorenzetti , Katie Luo , Gioele Zardini , Marco Pavone This is my paper
classification cs.ROcs.AIcs.CVcs.SYeess.SY
keywords robotautonomySee-Think-ActstackmotionplanningperceptionSLAMreinforcementlearningtextbook
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This is a textbook, not a research result, and its central claim is organizational: robot autonomy is best understood as a stack built on a See-Think-Act cycle. The authors assert that most modern autonomy stacks adopt some form of this loop, and that even end-to-end learned systems still perform the underlying functions of perceiving, reasoning, and acting, just with blurred boundaries. On that premise, the book presents the entire field—modeling, control, motion planning, perception, localization and mapping, decision-making, reinforcement learning, imitation learning—as parts of a single integrated framework. It pairs every major topic with runnable notebooks and exercises, so the claim extends beyond theory: a principled understanding of autonomy requires hands-on system-building. If the framework is right, a reader who works through it should be able to design, analyze, and contribute to a modern autonomy stack.

What carries the argument

The See-Think-Act cycle (Figure 2 in the preface) is the organizing object of the whole book. It is presented as a functional decomposition of any autonomous robot: See turns raw sensor data into semantic and geometric observations; Think fuses observations over time into a state estimate and selects behavior; Act turns decisions into trajectories and closed-loop actuator commands. The authors treat this loop as a blueprint that most modern autonomy stacks follow, and they use it to assign every chapter to a stage of the stack. The cycle does the work of unifying classical robotics and modern physical AI: it lets the book present linear and nonlinear control, trajectory optimization, percept

What would settle it

Document a production autonomy stack whose deployed architecture has no separable perception, state-estimation, planning, and control components—for instance, a single end-to-end network mapping raw sensor input to actuation with no intermediate representations. If such a system is representative of modern stacks rather than an exception, the book's premise that most stacks are built on a See-Think-Act structure fails.

Watch

Extended reading notes

Core claim

The book's central claim is that robot autonomy, despite drawing on many disciplines, can be taught and analyzed through one unifying conceptual structure: the See-Think-Act cycle. In this cycle, raw sensor signals are processed into local observations (See), those observations are integrated over time into a global state estimate and used for higher-level decision-making (Think), and decisions are converted into feasible trajectories executed through feedback control (Act). The authors argue that most modern autonomy stacks are organized this way in practice, and that the functional roles persist even in end-to-end systems where the architectural boundaries fade. The book is therefore struc

Load-bearing premise

The entire organization rests on the empirical claim, stated without a survey or citation, that most modern autonomy stacks adopt some form of See-Think-Act; if contemporary end-to-end systems really blur or discard those stages, the book's unified narrative would misrepresent the field.

Editorial extensions

If this is right

  • A reader who follows the book should be able to design, analyze, and contribute to an autonomy stack, because each algorithm is tied to a functional role in the loop.
  • The framework supplies a common vocabulary for comparing classical pipelines and end-to-end learned systems: even a monolithic model must still perceive, reason, and act.
  • The four-part structure maps directly onto the loop, so the same mental model that organizes the field also organizes the curriculum and its exercises.
  • Because every major topic is paired with executable notebooks, the book implies that practical proficiency is part of understanding autonomy, not an optional extra.
  • If the framework is correct, newcomers can enter the field through any stage—control, perception, estimation, or decision-making—and use the cycle to situate what they learn.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The framework carries an implicit curriculum bet: students learn autonomy better when it is introduced as one integrated loop rather than as separate subfields; this could be tested by comparing learning outcomes across differently organized courses.
  • If end-to-end models keep blurring the boundaries, the See-Think-Act labels may need to be reinterpreted as functional roles rather than architectural stages; the book already gestures at this by describing real systems as asynchronous graphs, and that graph view may eventually displace the loop as the organizing metaphor.
  • The book's insistence on system integration suggests that evaluation of autonomy research should shift from component-level benchmarks toward end-to-end, deployment-aware metrics—a consequence the text itself only partially draws.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. This pre-publication textbook, developed from Stanford's AA174A/AA274A and AA274B courses, offers a unified introduction to robot autonomy organized around a See–Think–Act cycle. After a Preface that motivates the framework and a chapter on ROS software, the book is organized into four parts: motion planning and control (Act), perception (See), localization and mapping (Think), and decision making, with a concluding Prospects chapter. The sampled content covers state-space modeling, holonomic and nonholonomic constraints, wheeled-robot kinematics, numerical integration (Euler, midpoint, RK4), open-loop optimal control (indirect methods via Pontryagin's Minimum Principle, direct collocation/shooting, differential flatness), and closed-loop control (PID, LQR, iLQR/DDP, MPC). The abstract's central claim is that the book provides a principled, accessible, deployment-aware foundation, bridging classical robotics and modern physical AI, with every major topic paired with Jupyter notebooks and exercises.

Significance. If the claims hold, this is a valuable and much-needed teaching resource spanning classical model-based robotics and learning-based methods. The spot-checked mathematics is accurate and standard: the pendulum derivations (Newton–Euler and Lagrange), Pfaffian constraints, kinematic models, PMP conditions, and direct/indirect transcriptions all match canonical references (Kirk, Murray, Siciliano et al.), and the included code snippets for integration, solve_bvp, collocation, and shooting are concrete and runnable. The book also ships a public exercise repository, which is a genuine strength for a textbook. Two issues need correction before it can be recommended without reservation: an unsupported empirical premise in the Preface and a bug in one flagship pseudocode block. Neither undermines the mathematical core, which is sound.

major comments (2)
  1. [Preface, near Fig. 2] The claim that 'most modern autonomy stacks adopt some form of See–Think–Act as the foundation for their behavior' is an empirical generalization offered with no survey or citation. The text's own acknowledgment that end-to-end approaches blur these boundaries, and that functional roles remain, makes the claim unfalsifiable: if See/Think/Act are defined broadly enough, every system possesses them by construction. Since the abstract's 'single conceptual framework' promise and the four-part book organization rest on this premise, the Preface should either substantiate 'most' with a cited survey that positions vision-language-action models and world models, or explicitly reframe See–Think–Act as a pedagogical decomposition rather than a description of industry practice. This is load-bearing for the book's narrative, but the fix is local to the Preface and Prospects.
  2. [Section 2.3.2, Algorithm 7] The shooting-method pseudocode does not implement the NLP stated above it. Inside the loop over ui, the code appends [x-M, y-l] at every time step; together with [M-x, l-y] and scipy's inequality constraint convention (g>=0), this forces x==M and y==l at every integration step, not only at the terminal index N. The stated problem enforces (x_N,y_N)=(M,ℓ) once at the final step. As printed, the constraint set is generically infeasible for nonconstant dynamics, which will mislead readers using the example. Fix: move the [x-M, y-l] lines after the loop. This is a local but real error in a flagship algorithm example.
minor comments (4)
  1. [Section 1.2.4] The cross-reference 'Theorem 1.2.6' should be 'Definition 1.2.6'—the column-space property is part of the definition of a kinematic model, not a theorem.
  2. [Section 2.1, Eq. (2.3)] The canonical problem statement fixes x(t_f)=x_f, but §2.1.1 allows free final state; the PMP boundary conditions in §2.2.3 then introduce cases not represented in (2.3). Suggest writing x(t_f) ∈ X_f and including the terminal cost h in (2.3) for consistency with the general cost (2.2).
  3. [Example 2.4.1] The flat-output reconstruction θ = tan⁻¹(ẏ/ẋ) is singular at ẋ=0; recommend using atan2(ẏ, ẋ) with a comment on the vertical-motion case, since the car model permits ẋ=0.
  4. [Example 2.2.1] The free-final-time example cites How [54] as '2008' with no URL; since this is a course handout, a stable link would help readers locate the source.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the textbook derives standard results from stated assumptions and external canonical references; the See-Think-Act framework is an organizational taxonomy, not a fitted prediction or self-justifying derivation.

full rationale

The manuscript is a textbook that proceeds by explicit assumption and derivation: it defines state-space models, kinematic constraints, optimal control problems, and then derives consequences (Pontryagin's Minimum Principle, direct/indirect methods, LQR, PID tracking, etc.). There is no fitting of parameters to data and no 'prediction' that reduces to an input. The only self-referential element is the acknowledgment that the book is based on the authors' Stanford courses, which is a normal provenance statement, not load-bearing evidence for any technical claim. The See–Think–Act framework is introduced as a functional taxonomy and is explicitly qualified: the text states that in end-to-end approaches 'the explicit boundaries between See, Think, and Act are increasingly blurred,' and that the functional roles remain; this is an organizational and pedagogical choice, not a derived result, so it cannot be circular. External canonical references (Kirk, Bertsekas, Murray, Siciliano, Aström and Murray, etc.) support the technical content. No uniqueness theorem is imported from the authors' prior work, no ansatz is smuggled in via self-citation, and no known empirical pattern is renamed as a new derivation. The derivation chain is self-contained relative to the book's stated assumptions, so the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The book introduces no free parameters and no invented entities. It depends on standard mathematical background and on two domain assumptions (See-Think-Act as the field's organizing principle, ROS as the standard middleware) that are presented without empirical support. All deeper theorems are imported from canonical external references, which is appropriate for a textbook.

assumptions (4)
  • standard math Standard undergraduate/graduate mathematical background: calculus, linear algebra, probability, optimization
    Used throughout without proof, appropriate for a graduate-level text.
  • domain assumption See-Think-Act is the conceptual framework that most modern autonomy stacks follow
    Stated in the Preface with Figure 2, presented as fact without a survey or citation.
  • domain assumption ROS is the de facto standard software substrate for robot autonomy
    The Robot Autonomy Software chapter asserts this as the basis for all programing exercises.
  • standard math Canonical results in control and estimation are taken as given: Pontryagin's Minimum Principle, Kalman filtering, SLAM, etc.
    Theorems are stated without proof and cited to Kirk, Siciliano et al., and other standard references.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Principles of Robot Autonomy." pith.science (2026). https://pith.science/paper/RQT7I5O2

@misc{pith2026260803496,
  author       = {Pith},
  title        = {Pith review of: Principles of Robot Autonomy},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RQT7I5O2}},
  note         = {Machine review of arXiv:2608.03496}
}
read the original abstract

Autonomous robots are moving rapidly from research labs into everyday life - on roads, in the air, in warehouses, and in space. Robot autonomy is no longer solely an academic pursuit, but a collection of mature, field-tested methods and tools that practitioners rely on in real-world deployments. This book offers a clear, unified introduction to the methods that make this possible. Built on decades of teaching at Stanford, the text develops the core elements of modern autonomy stacks within a single conceptual framework, bridging classical robotics and modern physical AI. Every major topic is paired with hands-on Jupyter notebooks and implementation-driven exercises, so readers build practical intuition alongside theoretical understanding. The result is a principled, accessible, and deployment-aware foundation for anyone seeking to design, analyze, or contribute to the next generation of autonomous systems. This is a comprehensive resource for students, engineers, and researchers entering one of today's fastest-growing fields.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

168 extracted references · 67 canonical work pages

  1. [1]

    Apprenticeship Learning via Inverse Reinforce- ment Learning

    P . Abbeel and A. Ng. “Apprenticeship Learning via Inverse Reinforce- ment Learning”. In:Proceedings of the Twenty-First International Conference on Machine Learning.2004

    2004

  2. [2]

    Alammar.The Illustrated Transformer.https://jalammar.github.io/ illustrated-transformer/

    J. Alammar.The Illustrated Transformer.https://jalammar.github.io/ illustrated-transformer/. Blog post. Accessed:2026-04-09. June2018

    2026

  3. [3]

    Alur.Algorithms for Decision Making

    R. Alur.Algorithms for Decision Making. MIT Press,2015

    2015

  4. [4]

    Deep evidential regression

    A. Amini et al. “Deep evidential regression”. In:Advances in neural infor- mation processing systems33(2020), pp.14927–14937

    2020

  5. [5]

    Conformal prediction: A gentle in- troduction

    A. N. Angelopoulos, S. Bates, et al. “Conformal prediction: A gentle in- troduction”. In:Foundations and trends® in machine learning16.4(2023), pp.494–591

    2023

  6. [6]

    A survey of inverse reinforcement learning: Chal- lenges, methods and progress

    S. Arora and P . Doshi. “A survey of inverse reinforcement learning: Chal- lenges, methods and progress”. In:Artificial Intelligence297(2021), p.103500

    2021

  7. [7]

    Reformulation of boundary value prob- lems into “standard

    U. M. Ascher and R. D. Russell. “Reformulation of boundary value prob- lems into “standard” form”. In:SIAM Review23.2(1981), pp.238–254

    1981

  8. [8]

    V-JEPA2: Self-Supervised Video Models Enable Un- derstanding, Prediction and Planning

    M. Assran et al. “V-JEPA2: Self-Supervised Video Models Enable Un- derstanding, Prediction and Planning”. In:arXiv preprint arXiv:2506.09985 (2025)

    arXiv 2025

Show all 168 references
  1. [9]

    K. J. Aström and R. M. Murray.Feedback Systems. Princeton University Press,2009

    2009

  2. [10]

    Training a Helpful and Harmless Assistant with Reinforce- ment Learning from Human Feedback

    Y. Bai et al. “Training a Helpful and Harmless Assistant with Reinforce- ment Learning from Human Feedback”. In: (2022).url:https://arxiv. org/abs/2204.05862

    2022 arXiv

  3. [11]

    Bar-Shalom, X

    Y. Bar-Shalom, X. R. Li, and T. Kirubarajan.Estimation with applications to tracking and navigation: theory algorithms and software. John Wiley & Sons, 2001

    2001

  4. [12]

    Bertsekas.Dynamic Programming and Optimal Control

    D. Bertsekas.Dynamic Programming and Optimal Control. Athena Scientific, 2000

    2000

  5. [13]

    Bertsekas.Nonlinear Programming

    D. Bertsekas.Nonlinear Programming. Athena Scientific,2016

    2016

  6. [14]

    Bertsekas.Reinforcement learning and optimal control

    D. Bertsekas.Reinforcement learning and optimal control. Athena Scientific, 2019. This material will be published by Cambridge University Press as Principles of Robot Autonomy by Daniele Gammelli, Joseph Lorenzetti, Katie Luo, Gioele Zardini and Marco Pavone. This pre-publicat...

    2019

  7. [15]

    The auction algorithm: A distributed relaxation method for the assignment problem

    D. P . Bertsekas. “The auction algorithm: A distributed relaxation method for the assignment problem”. In:Annals of operations research14.1(1988), pp.105–123

    1988

  8. [16]

    pi0: A Vision-Language-Action Flow Model for General Robot Control

    K. Black et al. “ pi0: A Vision-Language-Action Flow Model for General Robot Control”. In: (2024)

    2024

  9. [17]

    Blackman and R

    S. Blackman and R. Popoli.Design and Analysis of Modern Tracking Systems. Artech House,1999

    1999

  10. [18]

    On the Opportunities and Risks of Foundation Mod- els

    R. Bommasani et al. “On the Opportunities and Risks of Foundation Mod- els”. In:arXiv preprint arXiv:2108.07258(2021)

    2021 arXiv

  11. [19]

    Borrelli, A

    F. Borrelli, A. Bemporad, and M. Morari.Predictive Control for Linear and Hybrid Systems. Cambridge University Press,2017

    2017

  12. [20]

    The OpenCV Library

    G. Bradski. “The OpenCV Library”. In:Dr. Dobb’s Journal of Software Tools (2000)

    2000

  13. [21]

    Language Models are Few-Shot Learners

    T. B. Brown et al. “Language Models are Few-Shot Learners”. In:Advances in Neural Information Processing Systems.2020, pp.1877–1901

    2020

  14. [22]

    Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age

    C. Cadena et al. “Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age”. In:IEEE Transactions on robotics32.6(2017), pp.1309–1332

    2017

  15. [23]

    End-to-End Object Detection with Transformers

    Nicolas Carion et al. “End-to-End Object Detection with Transformers”. In:Computer Vision – ECCV2020. Springer International Publishing,2020, pp.213–229

    2020

  16. [24]

    Carlone et al., eds.SLAM Handbook

    L. Carlone et al., eds.SLAM Handbook. From Localization and Mapping to Spatial Intelligence. Cambridge University Press,2026

    2026

  17. [25]

    Learning to explore using active neural slam

    D. S. Chaplot et al. “Learning to explore using active neural slam”. In: arXiv preprint arXiv:2004.05155(2020)

    2004 arXiv

  18. [26]

    Interactive policy learning through confidence- based autonomy

    S. Chernova and M. Veloso. “Interactive policy learning through confidence- based autonomy”. In:Journal of Artificial Intelligence Research34.1(2009), pp.1–25.issn:1076-9757

    2009

  19. [27]

    Factor graphs and GTSAM: A hands-on introduction

    F. Dellaert. “Factor graphs and GTSAM: A hands-on introduction”. In: Georgia Institute of Technology, Tech. Rep2.4(2012)

    2012

  20. [28]

    Factor graphs: Exploiting structure in robotics

    F. Dellaert. “Factor graphs: Exploiting structure in robotics”. In:Annual Review of Control, Robotics, and Autonomous Systems4.1(2021), pp.141–166

    2021

  21. [29]

    Square root SAM: Simultaneous localization and mapping via square root information smoothing

    F. Dellaert and M. Kaess. “Square root SAM: Simultaneous localization and mapping via square root information smoothing”. In:The International Journal of Robotics Research25.12(2006), pp.1181–1203

    2006

  22. [30]

    Monte carlo localization for mobile robots

    F. Dellaert et al. “Monte carlo localization for mobile robots”. In:Proceed- ings1999IEEE international conference on robotics and automation (Cat. No. 99CH36288C). Vol.2. IEEE.1999, pp.1322–1328. REFERENCES521

    1999

  23. [31]

    Superpoint: Self-supervised interest point detection and description

    D. DeTone, T. Malisiewicz, and A. Rabinovich. “Superpoint: Self-supervised interest point detection and description”. In:Proceedings of the IEEE con- ference on computer vision and pattern recognition workshops.2018, pp.224– 236

    2018

  24. [32]

    An Image is Worth16x16Words: Transformers for Image Recognition at Scale

    A. Dosovitskiy et al. “An Image is Worth16x16Words: Transformers for Image Recognition at Scale”. In:International Conference on Learning Repre- sentations.2021

    2021

  25. [33]

    Inertial Sensors, GPS, and Odometry

    G. Dudek and M. Jenkin. “Inertial Sensors, GPS, and Odometry”. In: Springer Handbook of Robotics. Springer,2008, pp.477–490

    2008

  26. [34]

    RvS: What is Essential for Offline RL via Supervised Learning?

    S. Emmons et al. “RvS: What is Essential for Offline RL via Supervised Learning?” In:2021

    2021

  27. [35]

    Random sample consensus: a paradigm for model fitting with applications to image analysis and automated car- tography

    M. A. Fischler and R. C. Bolles. “Random sample consensus: a paradigm for model fitting with applications to image analysis and automated car- tography”. In:Commun. ACM24.6(1981), pp.381–395

    1981

  28. [36]

    On-manifold preintegration for real-time visual–inertial odometry

    C. Forster et al. “On-manifold preintegration for real-time visual–inertial odometry”. In:IEEE Transactions on Robotics33.1(2016), pp.1–21

    2016

  29. [37]

    D. A. Forsyth and J. Ponce.Computer Vision: A Modern Approach. Prentice Hall,2011

    2011

  30. [38]

    A compact algorithm for rectification of stereo pairs

    A. Fusiello, E. Trucco, and A. Verri. “A compact algorithm for rectification of stereo pairs”. In:Machine Vision and Applications12.1(2000), pp.16–22

    2000

  31. [39]

    Gelb et al.Applied optimal estimation

    A. Gelb et al.Applied optimal estimation. MIT press,1974

    1974

  32. [40]

    Fast R-CNN

    R. Girshick. “Fast R-CNN”. In:2015IEEE International Conference on Com- puter Vision (ICCV).2015, pp.1440–1448.doi:10.1109/ICCV.2015.169

    2015 doi

  33. [41]

    Goodfellow, Y

    I. Goodfellow, Y. Bengio, and A. Courville.Deep Learning.http://www. deeplearningbook.org. MIT Press,2016

    2016

  34. [42]

    Research blog

    Google DeepMind.Genie3: A New Frontier for World Models. Research blog. 2025.url:https://deepmind.google/blog/genie-3-a-new-frontier- for-world-models/

    2025

  35. [43]

    On calibration of modern neural networks

    C. Guo et al. “On calibration of modern neural networks”. In:International conference on machine learning. PMLR.2017, pp.1321–1330

    2017

  36. [44]

    Gustafsson.Statistical Sensor Fusion

    F. Gustafsson.Statistical Sensor Fusion. Studentlitteratur,2013, p.554

    2013

  37. [45]

    World Models

    D. Ha and J. Schmidhuber. “World Models”. In:arXiv preprint arXiv:1803.10122 (2018)

    2018 arXiv

  38. [46]

    Statecharts: A visual formalism for complex systems

    D. Harel. “Statecharts: A visual formalism for complex systems”. In:Sci- ence of Computer Programming8.3(1987), pp.231–274

    1987

  39. [47]

    A combined corner and edge detector

    C. Harris and M. Stephens. “A combined corner and edge detector”. In: 4th Alvey Vision Conference.1988

    1988

  40. [48]

    Camera Models

    R. Hartley and A. Zisserman. “Camera Models”. In:Multiple View Geome- try in Computer Vision. Academic Press,2002. 522 principles of robot autonomy

    2002

  41. [49]

    Motion and Path Planning

    K. Hauser. “Motion and Path Planning”. In:Encyclopedia of Robotics. Springer, 2020, pp.1–11

    2020

  42. [50]

    Mask R-CNN

    K. He et al. “Mask R-CNN”. In:Proceedings of the IEEE International Con- ference on Computer Vision.2017, pp.2961–2969

    2017

  43. [51]

    Numerical Methods for Two-Point Boundary Value Problems (Herbert B. Keller)

    J. Hertling. “Numerical Methods for Two-Point Boundary Value Problems (Herbert B. Keller)”. In:SIAM Review12.2(1970), pp.313–315

    1970

  44. [52]

    Imagen Video: High Definition Video Generation with Diffu- sion Models

    J. Ho et al. “Imagen Video: High Definition Video Generation with Diffu- sion Models”. In:arXiv preprint arXiv:2210.02303(2022)

    2022 arXiv

  45. [53]

    CyCADA: Cycle-Consistent Adversarial Domain Adap- tation

    J. Hoffman et al. “CyCADA: Cycle-Consistent Adversarial Domain Adap- tation”. In:Proceedings of the35th International Conference on Machine Learn- ing.2018, pp.1994–2003

    2018

  46. [54]

    J. P . How.Lecture Notes for Principles of Optimal Control.2008

    2008

  47. [55]

    Inner Monologue: Embodied Reasoning through Plan- ning with Language Models

    W. Huang et al. “Inner Monologue: Embodied Reasoning through Plan- ning with Language Models”. In:Proceedings of The6th Conference on Robot Learning.2023, pp.1769–1782

    2023

  48. [56]

    Deterministic sampling-based motion planning: Optimal- ity, complexity, and performance

    L. Janson et al. “Deterministic sampling-based motion planning: Optimal- ity, complexity, and performance”. In:Int. Journal of Robotics Research37.1 (2018), pp.46–61

    2018

  49. [57]

    Fast Marching Tree: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions

    L. Janson et al. “Fast Marching Tree: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions”. In:Int. Jour- nal of Robotics Research34.7(2015), pp.883–921

    2015

  50. [58]

    Joseph.Robot Operating System (ROS) for Absolute Beginners: Robotics Programming Made Easy

    L. Joseph.Robot Operating System (ROS) for Absolute Beginners: Robotics Programming Made Easy. Apress,2018

    2018

  51. [59]

    A non-divergent estimation algorithm in the presence of unknown correlations

    S. J. Julier and J. K. Uhlmann. “A non-divergent estimation algorithm in the presence of unknown correlations”. In:Proceedings of the1997American Control Conference (Cat. No.97CH36041). Vol.4. IEEE.1997, pp.2369–2373

    1997

  52. [60]

    New extension of the Kalman filter to nonlinear systems

    S. J. Julier and J. K. Uhlmann. “New extension of the Kalman filter to nonlinear systems”. In:Signal processing, sensor fusion, and target recognition VI. Vol.3068. Spie.1997, pp.182–193

    1997

  53. [61]

    Kaelbling et al.6.01SC: Introduction to Electrical Engineering and Computer Science I

    L. Kaelbling et al.6.01SC: Introduction to Electrical Engineering and Computer Science I. MIT OpenCourseWare.2011

    2011

  54. [62]

    iSAM: Incremental smooth- ing and mapping

    M. Kaess, A. Ranganathan, and F. Dellaert. “iSAM: Incremental smooth- ing and mapping”. In:IEEE Transactions on Robotics24.6(2008), pp.1365– 1378

    2008

  55. [63]

    iSAM2: Incremental smoothing and mapping using the Bayes tree

    M. Kaess et al. “iSAM2: Incremental smoothing and mapping using the Bayes tree”. In:The International Journal of Robotics Research31.2(2012), pp.216–235

    2012

  56. [64]

    Voxel-Based Extraction and Classification of3-D Pole-Like Objects From Mobile LiDAR Point Cloud Data

    Z. Kang et al. “Voxel-Based Extraction and Classification of3-D Pole-Like Objects From Mobile LiDAR Point Cloud Data”. In:IEEE Journal of Se- lected Topics in Applied Earth Observations and Remote Sensing11(Nov.2018), pp.4287–4298.doi:10.1109/JSTARS.2018.2869801. REFERENCES523

    2018

  57. [65]

    Sampling-based Algorithms for Optimal Motion Planning

    S. Karaman and E. Frazzoli. “Sampling-based Algorithms for Optimal Motion Planning”. In:Int. Journal of Robotics Research30.7(2011), pp.846– 894

    2011

  58. [66]

    Probabilistic roadmaps for path planning in high- dimensional configuration spaces

    L. E. Kavraki et al. “Probabilistic roadmaps for path planning in high- dimensional configuration spaces”. In:IEEE Transactions on Robotics and Automation12.4(1996), pp.566–580

    1996

  59. [67]

    An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation

    M. Kelly. “An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation”. In:SIAM Review59.4(2017), pp.849–904

    2017

  60. [68]

    Real-Time Obstacle Avoidance for Manipulators and Mobile Robots

    O. Khatib. “Real-Time Obstacle Avoidance for Manipulators and Mobile Robots”. In:The International Journal of Robotics Research5.1(1986), pp.90– 98

    1986

  61. [69]

    OpenVLA: An Open-Source Vision-Language-Action Model

    M. J. Kim et al. “OpenVLA: An Open-Source Vision-Language-Action Model”. In:Proceedings of The8th Conference on Robot Learning.2025, pp.2679– 2713

    2025

  62. [70]

    D. E. Kirk.Optimal Control Theory: An Introduction. Dover Publications, 2004

    2004

  63. [71]

    Parallel tracking and mapping for small AR workspaces

    G. Klein and D. Murray. “Parallel tracking and mapping for small AR workspaces”. In:2007 6th IEEE and ACM international symposium on mixed and augmented reality. IEEE.2007, pp.225–234

    2007

  64. [72]

    The Hungarian method for the assignment problem

    H. W. Kuhn. “The Hungarian method for the assignment problem”. In: Naval research logistics quarterly2.1-2(1955), pp.83–97

    1955

  65. [73]

    g2o: A general framework for graph optimization

    R. Kümmerle et al. “g2o: A general framework for graph optimization”. In:2011IEEE international conference on robotics and automation. IEEE.2011, pp.3607–3613

    2011

  66. [74]

    Simple and scalable predictive uncertainty estimation using deep ensembles

    B. Lakshminarayanan, A. Pritzel, and C. Blundell. “Simple and scalable predictive uncertainty estimation using deep ensembles”. In:Advances in neural information processing systems30(2017)

    2017

  67. [75]

    Pointpillars: Fast encoders for object detection from point clouds

    A. H. Lang et al. “Pointpillars: Fast encoders for object detection from point clouds”. In:Proceedings of the IEEE/CVF conference on computer vision and pattern recognition.2019, pp.12697–12705

    2019

  68. [76]

    J. C. Latombe.Robot Motion Planning. USA: Kluwer Academic Publishers, 1991

    1991

  69. [77]

    S. M. LaValle.Planning Algorithms. Cambridge, U.K.: Cambridge Univer- sity Press,2006

    2006

  70. [78]

    S. M. LaValle.Rapidly-Exploring Random Trees: A New Tool for Path Planning. 1998

    1998

  71. [79]

    Simultaneous map building and localization for an autonomous mobile robot

    J. J. Leonard and H. F. Durrant-Whyte. “Simultaneous map building and localization for an autonomous mobile robot.” In:IROS. Vol.3.1991, pp.1442–1447. 524 principles of robot autonomy

    1991

  72. [80]

    Levine.Analysis and Control of Nonlinear Systems: A Flatness-based Ap- proach

    J. Levine.Analysis and Control of Nonlinear Systems: A Flatness-based Ap- proach. Springer,2009

    2009

  73. [81]

    End-to-End Training of Deep Visuomotor Policies

    S. Levine et al. “End-to-End Training of Deep Visuomotor Policies”. In: Journal of Machine Learning Research17.39(2016), pp.1–40

    2016

  74. [83]

    Liggins II, D

    M. Liggins II, D. Hall, and J. Llinas.Handbook of multisensor data fusion: theory and practice. CRC press,2017

    2017

  75. [84]

    Object-Centric Learning with Slot Attention

    F. Locatello et al. “Object-Centric Learning with Slot Attention”. In:Ad- vances in Neural Information Processing Systems33.2020, pp.11525–11538

    2020

  76. [85]

    Computing rectifying homographies for stereo vision

    C. Loop and Z. Zhang. “Computing rectifying homographies for stereo vision”. In:IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol.1.1999, pp.125–131

    1999

  77. [86]

    Distinctive Image Features from Scale-Invariant Keypoints

    D. G. Lowe. “Distinctive Image Features from Scale-Invariant Keypoints”. In:International Journal of Computer Vision60.2(Nov.2004), pp.91–110. issn:1573-1405.doi:10.1023/B:VISI.0000029664.99615.94

    2004

  78. [87]

    Object recognition from local scale-invariant features

    D. G. Lowe. “Object recognition from local scale-invariant features”. In: Proceedings of the seventh IEEE international conference on computer vision. Vol.2. Ieee.1999, pp.1150–1157

    1999

  79. [88]

    Spatial planning: a configuration space approach

    T. Lozano Perez. “Spatial planning: a configuration space approach”. In: Autonomous Robot Vehicles.1990

    1990

  80. [89]

    Robot pose estimation in unknown environments by matching2d range scans

    F. Lu and E. Milios. “Robot pose estimation in unknown environments by matching2d range scans”. In:Journal of Intelligent and Robotic systems18.3 (1997), pp.249–275

    1997

  81. [90]

    K. M. Lynch and K. C. Park.Modern Robotics: Mechanics, Planning, and Control. Cambridge University Press,2017. Chap.8

    2017

  82. [91]

    Mahler.Statistical multisource-multitarget information fusion

    R. Mahler.Statistical multisource-multitarget information fusion. Artech,2007

    2007

  83. [92]

    Isaac Gym: High Performance GPU Based Physics Simulation For Robot Learning

    V . Makoviychuk et al. “Isaac Gym: High Performance GPU Based Physics Simulation For Robot Learning”. In:Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks.2021

    2021

  84. [93]

    P . S. Maybeck.Stochastic models, estimation, and control. Vol.3. Academic press,1982

    1982

  85. [94]

    Asynchronous Methods for Deep Reinforcement Learn- ing

    V . Mnih et al. “Asynchronous Methods for Deep Reinforcement Learn- ing”. In:Proceedings of The33rd International Conference on Machine Learn- ing.2016, pp.1928–1937

    2016

  86. [95]

    Playing Atari with Deep Reinforcement Learning

    V . Mnih et al. “Playing Atari with Deep Reinforcement Learning”. In: ArXivabs/1312.5602(2013).url:https://api.semanticscholar.org/ CorpusID:15238391. REFERENCES525

    2013 arXiv

  87. [96]

    FastSLAM2.0: An Improved Particle Filtering Al- gorithm for Simultaneous Localization and Mapping that Provably Con- verges

    M. Montemerlo et al. “FastSLAM2.0: An Improved Particle Filtering Al- gorithm for Simultaneous Localization and Mapping that Provably Con- verges”. In:Proceedings of the18th National Conference on Artificial Intelli- gence (AAAI).2003, pp.1151–1156

    2003

  88. [97]

    FastSLAM: A factored solution to the simultaneous localization and mapping problem

    M. Montemerlo et al. “FastSLAM: A factored solution to the simultaneous localization and mapping problem”. In:Aaai/iaai593598.2(2002), pp.593– 598

    2002

  89. [98]

    Towards automatic visual obstacle avoidance

    H. P . Moravec. “Towards automatic visual obstacle avoidance”. In:5th International Joint Conference on Artificial Intelligence.1977

    1977

  90. [99]

    ORB-SLAM: A versatile and accurate monocular SLAM system

    R. Mur-Artal, J. M. M. Montiel, and J. D. Tardos. “ORB-SLAM: A versatile and accurate monocular SLAM system”. In:IEEE transactions on robotics 31.5(2015), pp.1147–1163

    2015

  91. [100]

    K. P . Murphy.Probabilistic Machine Learning: An introduction. MIT Press, 2022

    2022

  92. [101]

    R. M. Murray.Optimization-Based Control. California Institute of Technol- ogy,2009

    2009

  93. [102]

    Algorithms for Inverse Reinforcement Learning

    A. Ng and S. Russell. “Algorithms for Inverse Reinforcement Learning”. In:Proceedings of the Seventeenth International Conference on Machine Learn- ing.2000, pp.663–670

    2000

  94. [103]

    Alpamayo-R1: Bridging Reasoning and Action Prediction for Generalizable Autonomous Driving in the Long Tail

    NVIDIA. “Alpamayo-R1: Bridging Reasoning and Action Prediction for Generalizable Autonomous Driving in the Long Tail”. In:arXiv preprint arXiv:2511.00088(2025)

    2025 arXiv

  95. [104]

    Cosmos World Foundation Model Platform for Physical AI

    NVIDIA. “Cosmos World Foundation Model Platform for Physical AI”. In:arXiv preprint arXiv:2501.03575(2025)

    2025 arXiv

  96. [105]

    NVIDIA.NVIDIA Halos: Autonomous Vehicle Safety.2024.url:https: //www.nvidia.com/en-us/ai-trust-center/halos/autonomous- vehicles/

    2024

  97. [106]

    Consensus and Coopera- tion in Networked Multi-Agent Systems

    R. Olfati-Saber, J. A. Fax, and R. M. Murray. “Consensus and Coopera- tion in Networked Multi-Agent Systems”. In:Proceedings of the IEEE95.1 (2007), pp.215–233

    2007

  98. [107]

    An Algorithmic Perspective on Imitation Learning

    T. Osa et al. “An Algorithmic Perspective on Imitation Learning”. In: (2018).url:https://arxiv.org/abs/1811.06711

    2018 arXiv

  99. [108]

    An overview on template match- ing methodologies and its applications

    N. Perveen, D. Kumar, and I. Bhardwaj. “An overview on template match- ing methodologies and its applications”. In:International Journal of Research in Computer and Communication Technology2.10(2013), pp.988–995

    2013

  100. [109]

    AI, OR and control theory: A Rosetta Stone for stochastic optimization

    W. B. Powell. “AI, OR and control theory: A Rosetta Stone for stochastic optimization”. In:Princeton University.2012

    2012

  101. [110]

    Puterman.Markov Decision Processes: Discrete Stochastic Dynamic Pro- gramming

    M. Puterman.Markov Decision Processes: Discrete Stochastic Dynamic Pro- gramming. Wiley,2014. 526 principles of robot autonomy

    2014

  102. [111]

    Pointnet: Deep learning on point sets for3d classification and segmentation

    C. R. Qi et al. “Pointnet: Deep learning on point sets for3d classification and segmentation”. In:Proceedings of the IEEE conference on computer vision and pattern recognition.2017, pp.652–660

    2017

  103. [112]

    Pointnet++: Deep hierarchical feature learning on point sets in a metric space

    C. R. Qi et al. “Pointnet++: Deep hierarchical feature learning on point sets in a metric space”. In:Advances in neural information processing systems 30(2017)

    2017

  104. [113]

    Vins-mono: A robust and versatile monocular visual-inertial state estimator

    T. Qin, P . Li, and S. Shen. “Vins-mono: A robust and versatile monocular visual-inertial state estimator”. In:IEEE transactions on robotics34.4(2018), pp.1004–1020

    2018

  105. [114]

    Quigley, B

    M. Quigley, B. Gerkey, and W. D. Smart.Programming Robots with ROS: A Practical Introduction to the Robot Operating System. O’Reilly Media,2015

    2015

  106. [115]

    Language Models are Unsupervised Multitask Learn- ers

    A. Radford et al. “Language Models are Unsupervised Multitask Learn- ers”. In: (2019)

    2019

  107. [116]

    Learning Transferable Visual Models From Natural Lan- guage Supervision

    A. Radford et al. “Learning Transferable Visual Models From Natural Lan- guage Supervision”. In:Proceedings of the38th International Conference on Machine Learning.2021, pp.8748–8763

    2021

  108. [117]

    A Survey of Numerical Methods for Optimal Control

    A. Rao. “A Survey of Numerical Methods for Optimal Control”. In:Ad- vances in the Astronautical Sciences135(2010)

    2010

  109. [118]

    Maximum Margin Planning

    N. Ratliff, J. A. Bagnell, and M. Zinkevich. “Maximum Margin Planning”. In:Proceedings of the23rd International Conference on Machine Learning.2006, pp.729–736

    2006

  110. [119]

    Maximum likelihood estimates of linear dynamic systems

    H. E. Rauch, F. Tung, and C. T. Striebel. “Maximum likelihood estimates of linear dynamic systems”. In:AIAA journal3.8(1965), pp.1445–1450

    1965

  111. [120]

    Rawlings, D

    J. Rawlings, D. Q. Mayne, and M. Diehl.Model Predictive Control: Theory, Computation, and Design. Nob Hill Publishing,2017

    2017

  112. [121]

    You Only Look Once: Unified, Real-Time Object Detec- tion

    J. Redmon et al. “You Only Look Once: Unified, Real-Time Object Detec- tion”. In:Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR). June2016

  113. [122]

    Rimon.Exact robot navigation using artificial potential functions

    E. Rimon.Exact robot navigation using artificial potential functions. PhD The- sis. Yale University,1990

    1990

  114. [123]

    Biological structure and function emerge from scaling unsupervised learning to250million protein sequences

    A. Rives et al. “Biological structure and function emerge from scaling unsupervised learning to250million protein sequences”. In:Proceedings of the National Academy of Sciences118.15(2021)

    2021

  115. [124]

    U-Net: Convolutional Networks for Biomedical Image Segmentation

    O. Ronneberger, P . Fischer, and T. Brox. “U-Net: Convolutional Networks for Biomedical Image Segmentation”. In:CoRRabs/1505.04597(2015). arXiv:1505.04597.url:http://arxiv.org/abs/1505.04597

    2015 arXiv

  116. [125]

    A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning

    S. Ross, G. Gordon, and D. Bagnell. “A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning”. In:Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statis- tics.2011, pp.627–635. REFERENCES527

    2011

  117. [126]

    Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generaliza- tion

    S. Sagawa et al. “Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generaliza- tion”. In:Proceedings of the International Conference on Learning Representa- tions.2020

    2020

  118. [127]

    Kinodynamic Planning

    E. Schmerling and M. Pavone. “Kinodynamic Planning”. In:Encyclopedia of Robotics. First. Springer,2019

    2019

  119. [128]

    A fast marching level set method for monotonically advanc- ing fronts

    J. A. Sethian. “A fast marching level set method for monotonically advanc- ing fronts”. In:Proceedings of the National Academy of Sciences93.4(1996), pp.1591–1595

    1996

  120. [129]

    PointRCNN:3D Object Proposal Generation and Detection From Point Cloud

    S. Shi, X. Wang, and H. Li. “PointRCNN:3D Object Proposal Generation and Detection From Point Cloud”. In:The IEEE Conference on Computer Vision and Pattern Recognition (CVPR). June2019

  121. [130]

    Survey of attitude representations

    M. D. Shuster. “Survey of attitude representations”. In:Journal of the As- tronautical Sciences41.4(1993), pp.439–517

    1993

  122. [131]

    Siciliano and O

    B. Siciliano and O. Khatib.Springer Handbook of Robotics. Springer-Verlag, 2007

    2007

  123. [132]

    Siciliano et al.Robotics: Modelling, Planning and Control

    B. Siciliano et al.Robotics: Modelling, Planning and Control. Springer Pub- lishing Company, Incorporated,2008. Chap.2

    2008

  124. [133]

    Siciliano et al.Robotics: Modelling, Planning and Control

    B. Siciliano et al.Robotics: Modelling, Planning and Control. Springer Pub- lishing Company, Incorporated,2008. Chap.7

    2008

  125. [134]

    Siciliano et al.Robotics: Modelling, Planning and Control

    B. Siciliano et al.Robotics: Modelling, Planning and Control. Springer Pub- lishing Company, Incorporated,2008

    2008

  126. [135]

    Siegwart, I

    R. Siegwart, I. R. Nourbakhsh, and D. Scaramuzza.Introduction to Au- tonomous Mobile Robots. MIT Press,2011

    2011

  127. [136]

    Mastering the game of Go with deep neural networks and tree search

    D. Silver et al. “Mastering the game of Go with deep neural networks and tree search”. In:Nature529.7587(2016), pp.484–489

    2016

  128. [137]

    Simon.Optimal State Estimation: Kalman, H ∞, and Nonlinear Approaches

    D. Simon.Optimal State Estimation: Kalman, H ∞, and Nonlinear Approaches. John Wiley & Sons,2006

    2006

  129. [138]

    Real-Time Anomaly Detection and Reactive Planning with Large Language Models

    R. Sinha et al. “Real-Time Anomaly Detection and Reactive Planning with Large Language Models”. In:Proceedings of Robotics: Science and Systems. 2024

    2024

  130. [139]

    Sipser.Introduction to the Theory of Computation

    M. Sipser.Introduction to the Theory of Computation. International Thomson Publishing,1996

    1996

  131. [140]

    Estimating uncertain spatial rela- tionships in robotics

    R. Smith, M. Self, and P . Cheeseman. “Estimating uncertain spatial rela- tionships in robotics”. In:Autonomous robot vehicles. Springer,1990, pp.167– 193

    1990

  132. [141]

    The focussed D* algorithm for real-time replanning

    A. Stentz. “The focussed D* algorithm for real-time replanning”. In:14th International Joint Conference on Artificial Intelligence.1995, pp.1652–1659

    1995

  133. [142]

    L. D. Stone et al.Bayesian multiple target tracking. Artech House,2013. 528 principles of robot autonomy

    2013

  134. [143]

    Sutton and A

    R. Sutton and A. Barto.Reinforcement learning: An introduction. MIT Press, 2018

    2018

  135. [144]

    Dyna, an integrated architecture for learning, planning, and reacting

    R. S. Sutton. “Dyna, an integrated architecture for learning, planning, and reacting”. In:SIGART Bull.2.4(1991), pp.160–163

    1991

  136. [145]

    Szeliski.Computer vision: algorithms and applications

    R. Szeliski.Computer vision: algorithms and applications. Springer Science & Business Media,2010

    2010

  137. [146]

    Tassa.Theory and Implementation of Biomimetic Motor Controllers

    Y. Tassa.Theory and Implementation of Biomimetic Motor Controllers. PhD Thesis. The Hebrew University of Jerusalem,2011

    2011

  138. [147]

    Learning for Safety-Critical Control with Control Barrier Functions

    A. Taylor et al. “Learning for Safety-Critical Control with Control Barrier Functions”. In:Learning for Dynamics and Control.2020, pp.708–717

    2020

  139. [148]

    Thrun, W

    S. Thrun, W. Burgard, and D. Fox.Probabilistic Robotics. MIT Press,2005

    2005

  140. [149]

    Occ3D: A Large-Scale3D Occupancy Prediction Benchmark for Autonomous Driving

    X. Tian et al. “Occ3D: A Large-Scale3D Occupancy Prediction Benchmark for Autonomous Driving”. In:arXiv preprint arXiv:2304.14365(2023)

    2023 arXiv

  141. [150]

    Torralba, P

    A. Torralba, P . Isola, and W. T. Freeman.Foundations of Computer Vision. Available under CC-BY-ND-NC license. Cambridge, MA: The MIT Press, 2024.isbn:978-0-262-04897-2

    2024

  142. [151]

    Bundle adjustment—a modern synthesis

    B. Triggs et al. “Bundle adjustment—a modern synthesis”. In:Vision Al- gorithms: Theory and Practice: International Workshop on Vision Algorithms Corfu, Greece, September21–22,1999Proceedings. Springer.2000, pp.298– 372

    2000

  143. [152]

    A Versatile Camera Calibration Technique for High-accuracy3D Machine Vision Metrology Using Off-the-shelf TV Cameras and Lenses

    R. Tsai. “A Versatile Camera Calibration Technique for High-accuracy3D Machine Vision Metrology Using Off-the-shelf TV Cameras and Lenses”. In:IEEE Journal on Robotics and Automation3.4(1987), pp.323–344

    1987

  144. [153]

    Selective Search for Object Recognition

    J. R. R. Uijlings et al. “Selective Search for Object Recognition”. In:Inter- national Journal of Computer Vision(2013)

    2013

  145. [154]

    Attention is All you Need

    A. Vaswani et al. “Attention is All you Need”. In:Advances in Neural In- formation Processing Systems. Vol.30. Curran Associates, Inc.,2017

    2017

  146. [155]

    The Gaussian mixture probability hypothesis density filter

    B.-N. Vo and W.-K. Ma. “The Gaussian mixture probability hypothesis density filter”. In:IEEE Transactions on signal processing54.11(2006), pp.4091– 4104

    2006

  147. [156]

    Labeled random finite sets and the Bayes multi-target tracking filter

    B.-N. Vo, B.-T. Vo, and D. Phung. “Labeled random finite sets and the Bayes multi-target tracking filter”. In:IEEE Transactions on Signal Process- ing62.24(2014), pp.6554–6567

    2014

  148. [157]

    Dynamic graph cnn for learning on point clouds

    Y. Wang et al. “Dynamic graph cnn for learning on point clouds”. In:ACM Transactions on Graphics (tog)38.5(2019), pp.1–12

    2019

  149. [158]

    Q-learning

    C. J. C. H. Watkins and P . Dayan. “Q-learning”. In:Machine Learning8.3 (1992), pp.279–292

    1992

  150. [159]

    Simple statistical gradient-following algorithms for con- nectionist reinforcement learning

    R. J. Williams. “Simple statistical gradient-following algorithms for con- nectionist reinforcement learning”. In:Machine Learning8.3(1992), pp.229– 256. REFERENCES529

    1992

  151. [160]

    Second: Sparsely embedded convolutional detection

    Y. Yan, Y. Mao, and B. Li. “Second: Sparsely embedded convolutional detection”. In:Sensors18.10(2018), p.3337

    2018

  152. [161]

    Robotic Control via Embodied Chain-of-Thought Rea- soning

    M. Zawalski et al. “Robotic Control via Embodied Chain-of-Thought Rea- soning”. In:Proceedings of The8th Conference on Robot Learning.2024

    2024

  153. [162]

    Visualizing and Understanding Convolu- tional Networks

    M. D. Zeiler and R. Fergus. “Visualizing and Understanding Convolu- tional Networks”. In:European Conference on Computer Vision (ECCV). Springer, 2014, pp.818–833

    2014

  154. [163]

    LOAM: Lidar odometry and mapping in real- time

    J. Zhang, S. Singh, et al. “LOAM: Lidar odometry and mapping in real- time.” In:Robotics: Science and systems. Vol.2.9. Berkeley, CA.2014, pp.1– 9

    2014

  155. [164]

    Tracking with multisensor out- of-sequence measurements with residual biases

    S. Zhang, Y. Bar-Shalom, and G. Watson. “Tracking with multisensor out- of-sequence measurements with residual biases”. In:2010 13th Interna- tional Conference on Information Fusion. IEEE.2010, pp.1–8

    2010

  156. [165]

    A Flexible New Technique for Camera Calibration

    Z. Zhang. “A Flexible New Technique for Camera Calibration”. In:IEEE Transactions on Pattern Analysis and Machine Intelligence22(2000)

    2000

  157. [166]

    Iterative point matching for registration of free-form curves and surfaces

    Z. Zhang. “Iterative point matching for registration of free-form curves and surfaces”. In:International journal of computer vision13.2(1994), pp.119– 152

    1994

  158. [167]

    Voxelnet: End-to-end learning for point cloud based3d object detection

    Y. Zhou and O. Tuzel. “Voxelnet: End-to-end learning for point cloud based3d object detection”. In:Proceedings of the IEEE conference on computer vision and pattern recognition.2018, pp.4490–4499

    2018

  159. [168]

    Maximum Entropy Inverse Reinforcement Learning

    B. D. Ziebart et al. “Maximum Entropy Inverse Reinforcement Learning”. In:Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence. 2008, pp.1433–1438

    2008

  160. [169]

    RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control

    B. Zitkovich et al. “RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control”. In:Proceedings of The7th Conference on Robot Learning.2023, pp.2165–2183

    2023

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.