Pith. sign in

REVIEW 184 references

Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigms

T0 review · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read A status map of 2015-2025 learning-based motion planning in dynamic environments, organized by four roles learning can play: direct policy, classical-planner augmentation, hybrid coupling, and training support.

arxiv 2608.00625 v1 pith:IMYLEERC submitted 2026-08-01 cs.RO cs.AI

Zongyuan Shen , Shalabh Gupta , Shancheng Zhao , Dehua Zhou , Gao Wang , Rui Cheng , Yaming Ou , Zhongqiang Ren
show 2 more authors
Yikui Zhai C. L. Philip Chen
This is my paper
classification cs.ROcs.AI
keywords planninglearning-basedclassicaldynamicenvironmentsmethodsmotionalgorithms
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

Robots that move among people and other moving objects — delivery robots, warehouse machines, drones, self-driving cars — must decide, every fraction of a second, where to go next while avoiding things that are themselves moving and often unpredictable. Classical planners solve this with rules and math models: search trees, velocity obstacles, potential fields, model-predictive control. Their weakness is that they depend on hand-tuned costs and simplified guesses about how people behave, so a large body of recent work adds machine learning to the mix.

This survey, by seven universities in China and the US, collects roughly 180 papers from 2015 to 2025 and sorts them by the role learning plays. In 'direct policy learning,' a neural network maps sensor readings straight to actions. In 'learning-augmented classical planning,' the learned model only tunes parameters, suggests search directions, or predicts where obstacles will be, while a classical planner keeps the final decision. 'Hybrid planning' couples both at run time — a classical global path plus a learned local controller, or a learned policy with a classical safety layer. 'Training enhancement' covers techniques that make policies train better, such as imitation learning from experts or randomizing simulated crowds.

The survey does not claim any of these families wins. Its product is the map itself: tables comparing methods, interaction models, and coupling structures, plus a list of open problems — sim-to-real gap, certifiable safety, dense crowds, perception-planning coupling, and embodied AI. Its main internal weakness is that the 'training enhancement' bucket describes how a model is trained, not the role learning plays at run time, so it is not really a peer of the other three categories. The selection of r

Extended reading notes

Core claim

The survey's central claim, stated in Section I-C: the field lacks "a unified and up-to-date review of learning-based motion planning in dynamic environments," and the paper fills the gap with a "role-of-learning taxonomy that characterizes how learning participates in the planning pipeline," yielding four categories: direct policy learning, learning-augmented classical planning, hybrid planning, and training enhancement. The conclusion (Section VII) sharpens the thesis: "learning is no longer limited to replacing classical planners with end-to-end policies. Learned models can serve as primary navigation policies, provide planner parameters, search guidance, obstacle predictions, intermediate references, policy-switching decisions, or training support." If the paper is correct, this four-role frame is the right high-level map of the 2015-2025 literature, and the field is accurately described by these four integration patterns.

Load-bearing premise

The taxonomy's four categories are mutually exclusive peers on a single "role of learning" axis. This breaks in Section VI: training enhancement (expert-guided training, scenario diversification) describes how a policy is trained, not the role learning plays at decision time. The methods there — e.g., [170] BC+GAIL initialization, [171] reward shaping via distillation — are also direct-policy, learning-augmented, or hybrid methods under the definitions in Sections I-C and V; a direct-policy method can use expert guidance, so the categories overlap by the paper's own examples. The survey never reconciles this: Section V distinguishes hybrid from direct-policy by runtime pipeline role, but no passage explains why training-time support is a fourth bucket rather than a cross-cutting dimension. Any conclusion drawn from the taxonomy's boundaries inherits this risk. Also load-bearing: the claim (Section I-C) that "representative works" fairly cover the field, with no documented selection pro

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.

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

The survey's claim rests on (1) the adequacy of the organizing frame, (2) the exhaustiveness claim over the literature, and (3) the fidelity of characterizations of cited works. No numbers are fitted to data, so free_parameters is empty; the only hand-chosen quantities are the date window (2015-2025) and the category names, which are scope choices rather than fitted parameters.

assumptions (4)
  • domain assumption The 'role-of-learning' axis is the most informative organizing principle for the surveyed literature.
    The survey's central organizing choice is stated in Section I-C ('we adopt a role-of-learning taxonomy'); nothing in the paper derives or defends this choice against alternative axes such as algorithm family, perception modality, or application domain.
  • ad hoc to paper The four categories are mutually exclusive and jointly exhaustive over the 2015-2025 literature.
    The taxonomy is the paper's own construction. Section VI's training enhancement describes training-time support rather than runtime role, so it overlaps the other three categories (e.g., [170] is a direct-policy method listed under training enhancement). The paper never reconciles this, making the exhaustiveness claim load-bearing and unsupported.
  • domain assumption The descriptions of each cited work faithfully represent that work's actual contribution and reported performance.
    The survey's content is a chain of characterizations of ~184 external papers (Sections II-VI, Tables I-X); the survey performs no primary verification, so accuracy is inherited from the source literature and from the authors' reading of it.
  • domain assumption The 'representative works' selected are sufficient to support the survey's conclusions about the field.
    Section I-C selects 'representative works' without stating search databases, inclusion/exclusion criteria, or coverage targets; conclusions about the field ('recent studies show...', Section VII) rest on this unstated sampling.
invented entities (1)
  • Role-of-learning taxonomy (four categories: direct policy learning, learning-augmented classical planning, hybrid planning, training enhancement)
    purpose: Organizational frame for grouping the surveyed literature
    The paper's only new construct. It is a descriptive category scheme with no falsifiable predictions; its validity is judged by whether the field adopts it, not by any test. Listed here per the ledger rule for new constructs ('a new ledger entry').

how reviews work

0 comments
Cite this review

Pith. "Pith review of Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigms." pith.science (2026). https://pith.science/paper/IMYLEERC

@misc{pith2026260800625,
  author       = {Pith},
  title        = {Pith review of: Learning-Based Motion Planning for Dynamic Environments: From Foundational Algorithms to Emerging Paradigms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IMYLEERC}},
  note         = {Machine review of arXiv:2608.00625}
}
read the original abstract

Motion planning in dynamic environments is a fundamental problem in robotics, aiming to generate safe and efficient paths, trajectories, or control actions in the presence of moving obstacles, uncertain predictions, and multi-agent interactions. It has broad applications in autonomous driving, service robotics, warehouse logistics, human-robot collaboration, crowd navigation, and multi-robot systems. This survey reviews representative works published primarily between 2015 and 2025, with a particular focus on how recent learning-based advances extend, complement, or interact with classical planning foundations. We first revisit classical planning methods as algorithmic foundations and reference frameworks for learning-based extensions. We then propose a role-of-learning taxonomy that categorizes existing methods according to how learning participates in the planning pipeline, including direct policy learning, learning-augmented classical planning, hybrid planning, and training enhancement methods. For each category, we summarize the main problem settings, representative algorithms, key ideas, integration mechanisms, strengths, and limitations. We further analyze how observation representations, prediction uncertainty, interaction modeling, planner integration, safety constraints, and training strategies shape learning-based motion planning in dynamic environments. Finally, we discuss open challenges and future directions, including sim-to-real gap, safe and certifiable planning, dense crowd navigation, perception-planning coupling, and embodied AI.

Figures

Figures reproduced from arXiv: 2608.00625 by the authors.

Figure 1
Figure 1. Application examples of motion planning in dynamic environ [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Taxonomy of motion planning in dynamic environments. [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

184 extracted references · 6 linked inside Pith

  1. [1]

    POSE.R: Prediction-based opportunistic sensing for resilient and efficient sensor networks,

    J. Z. Hare, J. Song, S. Gupta, and T. A. Wettergren, “POSE.R: Prediction-based opportunistic sensing for resilient and efficient sensor networks,”ACM Transactions on Sensor Networks, vol. 17, no. 1, pp. 1–41, 2020

    2020

  2. [2]

    Decentralized non- communicating multiagent collision avoidance with deep reinforcement learning,

    Y . F. Chen, M. Liu, M. Everett, and J. P. How, “Decentralized non- communicating multiagent collision avoidance with deep reinforcement learning,” inIEEE International Conference on Robotics and Automa- tion, pp. 285–292, 2017

    2017

  3. [3]

    Flexible active safety motion control for robotic obstacle avoidance: A CBF-guided MPC approach,

    J. Liu, J. Yang, J. Mao, T. Zhu, Q. Xie, Y . Li, X. Wang, and S. Li, “Flexible active safety motion control for robotic obstacle avoidance: A CBF-guided MPC approach,”IEEE Robotics and Automation Letters, vol. 10, no. 3, pp. 2686–2693, 2025

    2025

  4. [4]

    Robust mader: Decentralized multiagent trajectory planner ro- bust to communication delay in dynamic environments,

    K. Kondo, R. Figueroa, J. Rached, J. Tordesillas, P. C. Lusk, and J. P. How, “Robust mader: Decentralized multiagent trajectory planner ro- bust to communication delay in dynamic environments,”IEEE Robotics and Automation Letters, vol. 9, no. 2, pp. 1476–1483, 2024

    2024

  5. [5]

    Pointmoseg: Sparse tensor-based end-to-end moving-obstacle segmentation in 3-d lidar point clouds for autonomous driving,

    Y . Sun, W. Zuo, H. Huang, P. Cai, and M. Liu, “Pointmoseg: Sparse tensor-based end-to-end moving-obstacle segmentation in 3-d lidar point clouds for autonomous driving,”IEEE Robotics and Automation Letters, vol. 6, no. 2, pp. 510–517, 2021

    2021

  6. [6]

    SMART: Self- morphing adaptive replanning tree,

    Z. Shen, J. P. Wilson, S. Gupta, and R. Harvey, “SMART: Self- morphing adaptive replanning tree,”IEEE Robotics and Automation Letters, vol. 8, no. 11, pp. 7312–7319, 2023

    2023

  7. [7]

    Learning relation in crowd using gated graph convolutional networks for drl-based robot navigation,

    H. Jiang, N. Bhujel, Z. Lin, K.-W. Wan, J. Li, S. Jayavelu, and X. Jiang, “Learning relation in crowd using gated graph convolutional networks for drl-based robot navigation,”IEEE Transactions on Intelligent Transportation Systems, vol. 25, no. 6, pp. 5085–5095, 2024

    2024

  8. [8]

    Group- aware robot navigation in crowds using spatio-temporal graph atten- tion network with deep reinforcement learning,

    X. Lu, A. Faragasso, Y . Wang, A. Yamashita, and H. Asama, “Group- aware robot navigation in crowds using spatio-temporal graph atten- tion network with deep reinforcement learning,”IEEE Robotics and Automation Letters, vol. 10, no. 4, pp. 4140–4147, 2025

    2025

Show all 184 references
  1. [9]

    HeR- DRL:heterogeneous relational deep reinforcement learning for single- robot and multi-robot crowd navigation,

    X. Zhou, S. Piao, W. Chi, L. Chen, and W. Li, “HeR- DRL:heterogeneous relational deep reinforcement learning for single- robot and multi-robot crowd navigation,”IEEE Robotics and Automa- tion Letters, vol. 10, no. 5, pp. 4524–4531, 2025

    2025

  2. [10]

    RRT X: Asymptotically optimal single-query sampling-based motion planning with quick replanning,

    M. Otte and E. Frazzoli, “RRT X: Asymptotically optimal single-query sampling-based motion planning with quick replanning,”International Journal of Robotics Research, vol. 35, no. 7, pp. 797–822, 2016

    2016

  3. [11]

    Lifelong Planning A*,

    S. Koenig, M. Likhachev, and D. Furcy, “Lifelong Planning A*,” Artificial Intelligence, vol. 155, no. 1-2, pp. 93–146, 2004. 18

    2004

  4. [12]

    Motion planning in dynamic environments using velocity obstacles,

    P. Fiorini and Z. Shiller, “Motion planning in dynamic environments using velocity obstacles,”International Journal of Robotics Research, vol. 17, no. 7, pp. 760–772, 1998

    1998

  5. [13]

    Dynamic motion planning for mobile robots using potential field method,

    S. S. Ge and Y . J. Cui, “Dynamic motion planning for mobile robots using potential field method,”Autonomous Robots, vol. 13, pp. 207– 222, 2002

    2002

  6. [14]

    Deep-learned collision avoidance policy for distributed multiagent navigation,

    P. Long, W. Liu, and J. Pan, “Deep-learned collision avoidance policy for distributed multiagent navigation,”IEEE Robotics and Automation Letters, vol. 2, no. 2, pp. 656–663, 2017

    2017

  7. [15]

    Towards safe navigation through crowded dynamic environments,

    Z. Xie, P. Xin, and P. Dames, “Towards safe navigation through crowded dynamic environments,” inIEEE/RSJ International Confer- ence on Intelligent Robots and Systems, pp. 4934–4940, 2021

    2021

  8. [16]

    DRL-VO: Learning to navigate through crowded dynamic scenes using velocity obstacles,

    Z. Xie and P. Dames, “DRL-VO: Learning to navigate through crowded dynamic scenes using velocity obstacles,”IEEE Transactions on Robotics, vol. 39, no. 4, pp. 2700–2719, 2023

    2023

  9. [17]

    Environment- adaptive motion planning via reinforcement learning-based trajectory optimization,

    Z. Zhu, R. Wang, Y . Wang, Y . Wang, and X. Zhang, “Environment- adaptive motion planning via reinforcement learning-based trajectory optimization,”IEEE Transactions on Automation Science and Engi- neering, vol. 22, pp. 16704–16715, 2025

    2025

  10. [18]

    DR-MPC: Deep residual model predictive control for real-world social navigation,

    J. R. Han, H. Thomas, J. Zhang, N. Rhinehart, and T. D. Barfoot, “DR-MPC: Deep residual model predictive control for real-world social navigation,”IEEE Robotics and Automation Letters, vol. 10, no. 4, pp. 4029–4036, 2025

    2025

  11. [19]

    Dynamic adaptive dynamic window approach,

    M. Dobrevski and D. Sko ˇcaj, “Dynamic adaptive dynamic window approach,”IEEE Transactions on Robotics, vol. 40, pp. 3068–3081, 2024

    2024

  12. [20]

    Online and robust intermittent motion planning in dynamic and changing environments,

    Z. Xu, G. P. Kontoudis, and K. G. Vamvoudakis, “Online and robust intermittent motion planning in dynamic and changing environments,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 12, pp. 17425–17439, 2024

    2024

  13. [21]

    Distributed multi-robot collision avoidance via deep reinforcement learning for navigation in complex scenarios,

    T. Fan, P. Long, W. Liu, and J. Pan, “Distributed multi-robot collision avoidance via deep reinforcement learning for navigation in complex scenarios,”International Journal of Robotics Research, vol. 39, no. 7, pp. 856–892, 2020

    2020

  14. [22]

    Obstacle avoidance learning for robot motion planning in human–robot integration environ- ments,

    Y . Hong, Z. Ding, Y . Yuan, W. Chi, and L. Sun, “Obstacle avoidance learning for robot motion planning in human–robot integration environ- ments,”IEEE Transactions on Cognitive and Developmental Systems, vol. 15, no. 4, pp. 2169–2178, 2023

    2023

  15. [23]

    Sampling-based methods for motion planning with constraints,

    Z. Kingston, M. Moll, and L. E. Kavraki, “Sampling-based methods for motion planning with constraints,”Annual Review of Control, Robotics, and Autonomous Systems, vol. 1, no. 1, pp. 159–185, 2018

    2018

  16. [24]

    Asymptotically optimal sampling- based motion planning methods,

    J. D. Gammell and M. P. Strub, “Asymptotically optimal sampling- based motion planning methods,”Annual Review of Control, Robotics, and Autonomous Systems, vol. 4, no. 1, pp. 295–318, 2021

    2021

  17. [25]

    Sampling-based motion planning: A comparative review,

    A. Orthey, C. Chamzas, and L. E. Kavraki, “Sampling-based motion planning: A comparative review,”Annual Review of Control, Robotics, and Autonomous Systems, vol. 7, 2023

    2023

  18. [26]

    Path planning techniques for mobile robots: Review and prospect,

    L. Liu, X. Wang, X. Yang, H. Liu, J. Li, and P. Wang, “Path planning techniques for mobile robots: Review and prospect,”Expert Systems with Applications, vol. 227, p. 120254, 2023

    2023

  19. [27]

    A review on motion planning and obstacle avoidance approaches in dynamic environments,

    F. Kamil, S. Tang, W. Khaksar, N. Zulkifli, and S. A. Ahmad, “A review on motion planning and obstacle avoidance approaches in dynamic environments,”Advances in Robotics & Automation, vol. 4, no. 2, pp. 134–142, 2015

    2015

  20. [28]

    A survey of robotic motion plan- ning in dynamic environments,

    M. Mohanan and A. Salgoankar, “A survey of robotic motion plan- ning in dynamic environments,”Robotics and Autonomous Systems, vol. 100, pp. 171–185, 2018

    2018

  21. [29]

    Past, present and future of path-planning algorithms for mobile robot navi- gation in dynamic environments,

    H. S. Hewawasam, M. Y . Ibrahim, and G. K. Appuhamillage, “Past, present and future of path-planning algorithms for mobile robot navi- gation in dynamic environments,”IEEE Open Journal of the Industrial Electronics Society, vol. 3, pp. 353–365, 2022

    2022

  22. [30]

    Review on motion planning of robotic manipulator in dynamic environments,

    J. Liu, H. J. Yap, and A. S. M. Khairuddin, “Review on motion planning of robotic manipulator in dynamic environments,”Journal of Sensors, vol. 2024, no. 1, p. 5969512, 2024

    2024

  23. [31]

    Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,

    L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,”IEEE Transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996

    1996

  24. [32]

    Randomized kinodynamic plan- ning,

    S. M. LaValle and J. J. Kuffner Jr, “Randomized kinodynamic plan- ning,”International Journal of Robotics Research, vol. 20, no. 5, pp. 378–400, 2001

    2001

  25. [33]

    Sampling-based algorithms for optimal motion planning,

    S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,”International Journal of Robotics Research, vol. 30, no. 7, pp. 846–894, 2011

    2011

  26. [34]

    Real-time randomized path planning for robot navigation,

    J. Bruce and M. Veloso, “Real-time randomized path planning for robot navigation,” inIEEE International Conference on Intelligent Robots and Systems, vol. 3, pp. 2383–2388, 2002

    2002

  27. [35]

    Replanning with RRTs,

    D. Ferguson, N. Kalra, and A. Stentz, “Replanning with RRTs,” in IEEE International Conference on Robotics and Automation, pp. 1243– 1248, 2006

    2006

  28. [36]

    Multipartite RRTs for rapid replanning in dynamic environments,

    M. Zucker, J. Kuffner, and M. Branicky, “Multipartite RRTs for rapid replanning in dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 1603–1609, 2007

    2007

  29. [37]

    Fast asymptotically optimal path planning in dynamic, uncertain environments,

    L. Huang and X. Jing, “Fast asymptotically optimal path planning in dynamic, uncertain environments,” inIEEE/RSJ International Confer- ence on Intelligent Robots and Systems, pp. 2846–2852, 2023

    2023

  30. [38]

    Asymptotically optimal lazy lifelong sampling- based algorithm for efficient motion planning in dynamic environ- ments,

    L. Huang and X. Jing, “Asymptotically optimal lazy lifelong sampling- based algorithm for efficient motion planning in dynamic environ- ments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 8861–8867, 2024

    2024

  31. [39]

    Real-time fast marching tree for mobile robot motion planning in dynamic environments,

    J. Silveira, K. Cabral, S. Givigi, and J. A. Marshall, “Real-time fast marching tree for mobile robot motion planning in dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 7837–7843, 2023

    2023

  32. [40]

    Horizon-based lazy optimal RRT for fast, efficient replanning in dynamic environment,

    Y . Chen, Z. He, and S. Li, “Horizon-based lazy optimal RRT for fast, efficient replanning in dynamic environment,”Autonomous Robots, vol. 43, no. 8, pp. 2271–2292, 2019

    2019

  33. [41]

    An efficient RRT cache method in dynamic environments for path planning,

    C. Yuan, G. Liu, W. Zhang, and X. Pan, “An efficient RRT cache method in dynamic environments for path planning,”Robotics and Autonomous Systems, vol. 131, p. 103595, 2020

    2020

  34. [42]

    MOD-RRT*: A sampling-based algorithm for robot path planning in dynamic environment,

    J. Qi, H. Yang, and H. Sun, “MOD-RRT*: A sampling-based algorithm for robot path planning in dynamic environment,”IEEE Transactions on Industrial Electronics, vol. 68, no. 8, pp. 7244–7251, 2021

    2021

  35. [43]

    Path re-planning design of a cobot in a dynamic environment based on current obstacle configuration,

    C.-C. Lee and K.-T. Song, “Path re-planning design of a cobot in a dynamic environment based on current obstacle configuration,”IEEE Robotics and Automation Letters, vol. 8, no. 3, pp. 1183–1190, 2023

    2023

  36. [44]

    RT-RRT: Reverse tree guided real-time path planning/replanning in unpredictable dynamic environments,

    B. Cui, R. Cui, W. Yan, Y . Wang, and S. Zhang, “RT-RRT: Reverse tree guided real-time path planning/replanning in unpredictable dynamic environments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5380–5387, 2024

    2024

  37. [45]

    Dynamic risk tolerance: Motion planning by balancing short-term and long-term stochastic dynamic predictions,

    H.-T. L. Chiang, B. HomChaudhuri, A. P. Vinod, M. Oishi, and L. Tapia, “Dynamic risk tolerance: Motion planning by balancing short-term and long-term stochastic dynamic predictions,” inIEEE International Conference on Robotics and Automation, pp. 3762–3769, 2017

    2017

  38. [46]

    Risk-DTRRT- based optimal motion planning algorithm for mobile robots,

    W. Chi, C. Wang, J. Wang, and M. Q.-H. Meng, “Risk-DTRRT- based optimal motion planning algorithm for mobile robots,”IEEE Transactions on Automation Science and Engineering, vol. 16, no. 3, pp. 1271–1288, 2019

    2019

  39. [47]

    Human- aware path planning with improved virtual doppler method in highly dynamic environments,

    K. Cai, W. Chen, C. Wang, S. Song, and M. Q.-H. Meng, “Human- aware path planning with improved virtual doppler method in highly dynamic environments,”IEEE Transactions on Automation Science and Engineering, vol. 20, no. 2, pp. 1304–1321, 2023

    2023

  40. [48]

    Distributionally robust risk map for learning-based motion planning and control: A semidefinite program- ming approach,

    A. Hakobyan and I. Yang, “Distributionally robust risk map for learning-based motion planning and control: A semidefinite program- ming approach,”IEEE Transactions on Robotics, vol. 39, no. 1, pp. 718–737, 2023

    2023

  41. [49]

    Multi-Risk-RRT: An efficient motion planning algorithm for robotic autonomous luggage trolley collection at airports,

    Z. Sun, B. Lei, P. Xie, F. Liu, J. Gao, Y . Zhang, and J. Wang, “Multi-Risk-RRT: An efficient motion planning algorithm for robotic autonomous luggage trolley collection at airports,”IEEE Transactions on Intelligent Vehicles, vol. 9, no. 2, pp. 3450–3463, 2024

    2024

  42. [50]

    A note on two problems in connexion with graphs,

    E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959

    1959

  43. [51]

    A formal basis for the heuristic determination of minimum cost paths,

    P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968

    1968

  44. [52]

    The focussed D* algorithm for real-time replanning,

    A. Stentzet al., “The focussed D* algorithm for real-time replanning,” inIJCAI, vol. 95, pp. 1652–1659, 1995

    1995

  45. [53]

    D* lite,

    S. Koenig and M. Likhachev, “D* lite,” in18th National Conference on Artificial Intelligence, pp. 476–483, 2002

    2002

  46. [54]

    Multi-objective path-based D* lite,

    Z. Ren, S. Rathinam, M. Likhachev, and H. Choset, “Multi-objective path-based D* lite,”IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 3318–3325, 2022

    2022

  47. [55]

    Bidirectional search strategy for incremental search-based path planning,

    C. Li, H. Ma, J. Wang, and M. Q.-H. Meng, “Bidirectional search strategy for incremental search-based path planning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 7311– 7317, 2023

    2023

  48. [56]

    SIPP: Safe interval path planning for dynamic environments,

    M. Phillips and M. Likhachev, “SIPP: Safe interval path planning for dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 5628–5635, 2011

    2011

  49. [57]

    Planning in domains with cost function dependent actions,

    M. Phillips and M. Likhachev, “Planning in domains with cost function dependent actions,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 25, pp. 74–80, 2011. 19

    2011

  50. [58]

    Anytime safe interval path planning for dynamic environments,

    V . Narayanan, M. Phillips, and M. Likhachev, “Anytime safe interval path planning for dynamic environments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4708–4715, 2012

    2012

  51. [59]

    Using state domi- nance for path planning in dynamic environments with moving obsta- cles,

    J. P. Gonzalez, A. Dornbush, and M. Likhachev, “Using state domi- nance for path planning in dynamic environments with moving obsta- cles,” inIEEE International Conference on Robotics and Automation, pp. 4009–4015, 2012

    2012

  52. [60]

    Multi-objective safe-interval path planning with dynamic obstacles,

    Z. Ren, S. Rathinam, M. Likhachev, and H. Choset, “Multi-objective safe-interval path planning with dynamic obstacles,”IEEE Robotics and Automation Letters, vol. 7, no. 3, pp. 8154–8161, 2022

    2022

  53. [61]

    Dynamic channel: A planning framework for crowd navigation,

    C. Cao, P. Trautman, and S. Iba, “Dynamic channel: A planning framework for crowd navigation,” inIEEE International Conference on Robotics and Automation, pp. 5551–5557, 2019

    2019

  54. [62]

    Safe interval motion plan- ning for quadrotors in dynamic environments,

    S. Huang, Y . Wu, Y . Tao, and V . Kumar, “Safe interval motion plan- ning for quadrotors in dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 2780–2786, 2025

    2025

  55. [63]

    Search- based online trajectory planning for car-like robots in highly dynamic environments,

    J. Lin, T. Zhou, D. Zhu, J. Liu, and M. Q.-H. Meng, “Search- based online trajectory planning for car-like robots in highly dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 8151–8157, 2021

    2021

  56. [64]

    RAST: Risk-aware spatio-temporal safety corridors for MA V navi- gation in dynamic uncertain environments,

    G. Chen, S. Wu, M. Shi, W. Dong, H. Zhu, and J. Alonso-Mora, “RAST: Risk-aware spatio-temporal safety corridors for MA V navi- gation in dynamic uncertain environments,”IEEE Robotics and Au- tomation Letters, vol. 8, no. 2, pp. 808–815, 2023

    2023

  57. [65]

    Risk-aware trajectory sam- pling for quadrotor obstacle avoidance in dynamic environments,

    G. Chen, P. Peng, P. Zhang, and W. Dong, “Risk-aware trajectory sam- pling for quadrotor obstacle avoidance in dynamic environments,”IEEE Transactions on Industrial Electronics, vol. 70, no. 12, pp. 12606– 12615, 2023

    2023

  58. [66]

    Hierarchical motion plan- ning for autonomous vehicles in unstructured dynamic environments,

    Y . Qi, B. He, R. Wang, L. Wang, and Y . Xu, “Hierarchical motion plan- ning for autonomous vehicles in unstructured dynamic environments,” IEEE Robotics and Automation Letters, vol. 8, no. 2, pp. 496–503, 2023

    2023

  59. [67]

    Safe lattice planning for motion planning with dynamic obstacles,

    E. Wiman and M. Tiger, “Safe lattice planning for motion planning with dynamic obstacles,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 9287–9294, 2025

    2025

  60. [68]

    A real-time approach for chance-constrained motion planning with dynamic obstacles,

    M. Castillo-Lopez, P. Ludivig, S. A. Sajadi-Alamdari, J. L. Sanchez- Lopez, M. A. Olivares-Mendez, and H. V oos, “A real-time approach for chance-constrained motion planning with dynamic obstacles,”IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 3620–3625, 2020

    2020

  61. [69]

    Model predictive contouring control for collision avoidance in unstructured dynamic environments,

    B. Brito, B. Floor, L. Ferranti, and J. Alonso-Mora, “Model predictive contouring control for collision avoidance in unstructured dynamic environments,”IEEE Robotics and Automation Letters, vol. 4, no. 4, pp. 4459–4466, 2019

    2019

  62. [70]

    Chance-constrained optimal path planning with obstacles,

    L. Blackmore, M. Ono, and B. C. Williams, “Chance-constrained optimal path planning with obstacles,”IEEE Transactions on Robotics, vol. 27, no. 6, pp. 1080–1094, 2011

    2011

  63. [71]

    Chance-constrained collision avoidance for MA Vs in dynamic environments,

    H. Zhu and J. Alonso-Mora, “Chance-constrained collision avoidance for MA Vs in dynamic environments,”IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 776–783, 2019

    2019

  64. [72]

    Scenario-based trajectory optimization in uncertain dynamic environ- ments,

    O. de Groot, B. Brito, L. Ferranti, D. Gavrila, and J. Alonso-Mora, “Scenario-based trajectory optimization in uncertain dynamic environ- ments,”IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 5389– 5396, 2021

    2021

  65. [73]

    Dynamic control barrier function-based model predictive control to safety-critical obstacle-avoidance of mobile robot,

    Z. Jian, Z. Yan, X. Lei, Z. Lu, B. Lan, X. Wang, and B. Liang, “Dynamic control barrier function-based model predictive control to safety-critical obstacle-avoidance of mobile robot,” inIEEE Interna- tional Conference on Robotics and Automation, pp. 3679–3685, 2023

    2023

  66. [74]

    Risk euclidean distance-based model predictive path integral to safety- critical obstacle avoidance,

    Z. Huang, R. Li, W. Chen, Z. Lin, Z. Wu, and B. Zhang, “Risk euclidean distance-based model predictive path integral to safety- critical obstacle avoidance,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1906–1913, 2025

    1906

  67. [75]

    Reactive collision avoidance for safe agile navigation,

    A. Saviolo, N. Picello, J. Mao, R. Verma, and G. Loianno, “Reactive collision avoidance for safe agile navigation,” inIEEE International Conference on Robotics and Automation, pp. 16125–16132, 2025

    2025

  68. [76]

    Topology-driven parallel trajectory optimization in dynamic environ- ments,

    O. de Groot, L. Ferranti, D. M. Gavrila, and J. Alonso-Mora, “Topology-driven parallel trajectory optimization in dynamic environ- ments,”IEEE Transactions on Robotics, vol. 41, pp. 110–126, 2025

    2025

  69. [77]

    Visibility-based proba- bilistic roadmaps for motion planning,

    T. Sim ´eon, J.-P. Laumond, and C. Nissoux, “Visibility-based proba- bilistic roadmaps for motion planning,”Advanced Robotics, vol. 14, no. 6, pp. 477–493, 2000

    2000

  70. [78]

    DS-MPEPC: Safe and deadlock-avoiding robot navigation in cluttered dynamic scenes,

    S. H. Arul, J. J. Park, and D. Manocha, “DS-MPEPC: Safe and deadlock-avoiding robot navigation in cluttered dynamic scenes,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2256–2263, 2023

    2023

  71. [79]

    Reciprocal velocity obstacles for real-time multi-agent navigation,

    J. Van den Berg, M. Lin, and D. Manocha, “Reciprocal velocity obstacles for real-time multi-agent navigation,” inIEEE International Conference on Robotics and Automation, pp. 1928–1935, 2008

    1928

  72. [80]

    The hybrid reciprocal velocity obstacle,

    J. Snape, J. Van Den Berg, S. J. Guy, and D. Manocha, “The hybrid reciprocal velocity obstacle,”IEEE Transactions on Robotics, vol. 27, no. 4, pp. 696–706, 2011

    2011

  73. [81]

    Relaxing the limitations of the optimal reciprocal collision avoidance algorithm for mobile robots in crowds,

    Z. Liu, W. Na, C. Yao, C. Liu, and Q. Chen, “Relaxing the limitations of the optimal reciprocal collision avoidance algorithm for mobile robots in crowds,”IEEE Robotics and Automation Letters, vol. 9, no. 6, pp. 5520–5527, 2024

    2024

  74. [82]

    A VOCADO: Adaptive optimal collision avoidance driven by opinion,

    D. Martinez-Baselga, E. Sebasti ´an, E. Montijano, L. Riazuelo, C. Sag ¨u´es, and L. Montano, “A VOCADO: Adaptive optimal collision avoidance driven by opinion,”IEEE Transactions on Robotics, vol. 41, pp. 2495–2511, 2025

    2025

  75. [83]

    Smooth and collision-free navigation for multiple robots under differential- drive constraints,

    J. Snape, J. Van Den Berg, S. J. Guy, and D. Manocha, “Smooth and collision-free navigation for multiple robots under differential- drive constraints,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4584–4589, 2010

    2010

  76. [84]

    Reciprocal collision avoidance with acceleration-velocity obstacles,

    J. Van Den Berg, J. Snape, S. J. Guy, and D. Manocha, “Reciprocal collision avoidance with acceleration-velocity obstacles,” inIEEE In- ternational Conference on Robotics and Automation, pp. 3475–3482, 2011

    2011

  77. [85]

    Reciprocal collision avoidance for robots with linear dynamics using LQR-obstacles,

    D. Bareiss and J. Van den Berg, “Reciprocal collision avoidance for robots with linear dynamics using LQR-obstacles,” inIEEE Interna- tional Conference on Robotics and Automation, pp. 3847–3853, 2013

    2013

  78. [86]

    Solving the real- time motion planning problem for non-holonomic robots with collision avoidance in dynamic scenes,

    L. Zhao, J. Zhao, Z. Liu, D. Yang, and H. Liu, “Solving the real- time motion planning problem for non-holonomic robots with collision avoidance in dynamic scenes,”IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 10510–10517, 2022

    2022

  79. [87]

    Path- guided artificial potential fields with stochastic reachable sets for mo- tion planning in highly dynamic environments,

    H.-T. Chiang, N. Malone, K. Lesser, M. Oishi, and L. Tapia, “Path- guided artificial potential fields with stochastic reachable sets for mo- tion planning in highly dynamic environments,” inIEEE International Conference on Robotics and Automation, pp. 2347–2354, 2015

    2015

  80. [88]

    Hybrid dynamic moving obstacle avoidance using a stochastic reachable set- based potential field,

    N. Malone, H.-T. Chiang, K. Lesser, M. Oishi, and L. Tapia, “Hybrid dynamic moving obstacle avoidance using a stochastic reachable set- based potential field,”IEEE Transactions on Robotics, vol. 33, no. 5, pp. 1124–1138, 2017

    2017

  81. [89]

    Socially-aware reactive obstacle avoidance strategy based on limit cycle,

    M. Boldrer, M. Andreetto, S. Divan, L. Palopoli, and D. Fontanelli, “Socially-aware reactive obstacle avoidance strategy based on limit cycle,”IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 3251– 3258, 2020

    2020

  82. [90]

    Avoiding dense and dynamic obstacles in enclosed spaces: Application to moving in crowds,

    L. Huber, J.-J. Slotine, and A. Billard, “Avoiding dense and dynamic obstacles in enclosed spaces: Application to moving in crowds,”IEEE Transactions on Robotics, vol. 38, no. 5, pp. 3113–3132, 2022

    2022

  83. [91]

    Enhanced adaptive artificial potential field for UA V navigation in dynamic 3D environ- ments with lightweight spherical obstacle map,

    Y . Wang, H. Wu, X. Xu, Y . Sun, and X. Zeng, “Enhanced adaptive artificial potential field for UA V navigation in dynamic 3D environ- ments with lightweight spherical obstacle map,”IEEE Robotics and Automation Letters, vol. 11, no. 1, pp. 682–689, 2026

    2026

  84. [92]

    The dynamic window approach to collision avoidance,

    D. Fox, W. Burgard, and S. Thrun, “The dynamic window approach to collision avoidance,”IEEE Robotics & Automation Magazine, vol. 4, no. 1, pp. 23–33, 1997

    1997

  85. [93]

    Predictive collision avoidance for the dynamic window approach,

    M. Missura and M. Bennewitz, “Predictive collision avoidance for the dynamic window approach,” inIEEE International Conference on Robotics and Automation, pp. 8620–8626, 2019

    2019

  86. [94]

    Long-term dynamic window approach for kinodynamic local planning in static and crowd environments,

    Z. Jian, S. Zhang, L. Sun, W. Zhan, N. Zheng, and M. Tomizuka, “Long-term dynamic window approach for kinodynamic local planning in static and crowd environments,”IEEE Robotics and Automation Letters, vol. 8, no. 6, pp. 3294–3301, 2023

    2023

  87. [95]

    Elastic bands: Connecting path planning and control,

    S. Quinlan and O. Khatib, “Elastic bands: Connecting path planning and control,” inIEEE International Conference on Robotics and Automation, pp. 802–807, 1993

    1993

  88. [96]

    Safe and efficient dynamic window approach for differential mobile robots with stochastic dy- namics using deterministic sampling,

    S. Yasuda, T. Kumagai, and H. Yoshida, “Safe and efficient dynamic window approach for differential mobile robots with stochastic dy- namics using deterministic sampling,”IEEE Robotics and Automation Letters, vol. 8, no. 5, pp. 2614–2621, 2023

    2023

  89. [97]

    Gradient field- based dynamic window approach for collision avoidance in complex environments,

    Z. Zhang, Y . Xue, N. Figueroa, and K. ˚Akesson, “Gradient field- based dynamic window approach for collision avoidance in complex environments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 19669–19674, 2025

    2025

  90. [98]

    Towards optimally decentralized multi-robot collision avoidance via deep re- inforcement learning,

    P. Long, T. Fan, X. Liao, W. Liu, H. Zhang, and J. Pan, “Towards optimally decentralized multi-robot collision avoidance via deep re- inforcement learning,” inIEEE International Conference on Robotics and Automation, pp. 6252–6259, 2018

    2018

  91. [99]

    Spatiotemporal attention enhances lidar-based robot navigation in dynamic environments,

    J. de Heuvel, X. Zeng, W. Shi, T. Sethuraman, and M. Bennewitz, “Spatiotemporal attention enhances lidar-based robot navigation in dynamic environments,”IEEE Robotics and Automation Letters, vol. 9, no. 5, pp. 4202–4209, 2024. 20

    2024

  92. [100]

    Towards multi- modal perception-based navigation: A deep reinforcement learning method,

    X. Huang, H. Deng, W. Zhang, R. Song, and Y . Li, “Towards multi- modal perception-based navigation: A deep reinforcement learning method,”IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 4986–4993, 2021

    2021

  93. [101]

    Deep reinforcement learning for robot collision avoidance with self-state-attention and sensor fusion,

    Y . Han, I. H. Zhan, W. Zhao, J. Pan, Z. Zhang, Y . Wang, and Y .-J. Liu, “Deep reinforcement learning for robot collision avoidance with self-state-attention and sensor fusion,”IEEE Robotics and Automation Letters, vol. 7, no. 3, pp. 6886–6893, 2022

    2022

  94. [102]

    Reciprocal n-body collision avoidance,

    J. Van Den Berg, S. J. Guy, M. Lin, and D. Manocha, “Reciprocal n-body collision avoidance,” inRobotics Research: The 14th Interna- tional Symposium ISRR, pp. 3–19, Springer, 2011

    2011

  95. [103]

    A tutorial on partially observable markov decision pro- cesses,

    M. L. Littman, “A tutorial on partially observable markov decision pro- cesses,”Journal of Mathematical Psychology, vol. 53, no. 3, pp. 119– 125, 2009

    2009

  96. [104]

    Prox- imal policy optimization algorithms,

    J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Prox- imal policy optimization algorithms,”arXiv preprint arXiv:1707.06347, 2017

    2017 arXiv

  97. [105]

    Getting robots unfrozen and unlost in dense pedestrian crowds,

    T. Fan, X. Cheng, J. Pan, P. Long, W. Liu, R. Yang, and D. Manocha, “Getting robots unfrozen and unlost in dense pedestrian crowds,”IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 1178–1185, 2019

    2019

  98. [106]

    Continuous control with deep reinforce- ment learning,

    T. P. Lillicrap, J. J. Hunt, A. Pritzel, N. Heess, T. Erez, Y . Tassa, D. Silver, and D. Wierstra, “Continuous control with deep reinforce- ment learning,”arXiv preprint arXiv:1509.02971, 2015

    2015 arXiv

  99. [107]

    Flying in highly dynamic en- vironments with end-to-end learning approach,

    X. Fan, M. Lu, B. Xu, and P. Lu, “Flying in highly dynamic en- vironments with end-to-end learning approach,”IEEE Robotics and Automation Letters, vol. 10, no. 4, pp. 3851–3858, 2025

    2025

  100. [108]

    Deep local trajectory replanning and control for robot navigation,

    A. Pokle, R. Mart ´ın-Mart´ın, P. Goebel, V . Chow, H. M. Ewald, J. Yang, Z. Wang, A. Sadeghian, D. Sadigh, S. Savarese,et al., “Deep local trajectory replanning and control for robot navigation,” inIEEE International Conference on Robotics and Automation, pp. 5815–5822, 2019

    2019

  101. [109]

    Layered costmaps for context-sensitive navigation,

    D. V . Lu, D. Hershberger, and W. D. Smart, “Layered costmaps for context-sensitive navigation,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 709–715, 2014

    2014

  102. [110]

    Gradient-based learning applied to document recognition,

    Y . LeCun, L. Bottou, Y . Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,”Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2324, 1998

    1998

  103. [111]

    Sparse-to-Dense: Depth prediction from sparse depth samples and a single image,

    F. Ma and S. Karaman, “Sparse-to-Dense: Depth prediction from sparse depth samples and a single image,” inIEEE International Conference on Robotics and Automation, pp. 4796–4803, 2018

    2018

  104. [112]

    Socially aware motion planning with deep reinforcement learning,

    Y . F. Chen, M. Everett, M. Liu, and J. P. How, “Socially aware motion planning with deep reinforcement learning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1343–1350, 2017

    2017

  105. [113]

    Motion planning among dynamic, decision-making agents with deep reinforcement learning,

    M. Everett, Y . F. Chen, and J. P. How, “Motion planning among dynamic, decision-making agents with deep reinforcement learning,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3052–3059, 2018

    2018

  106. [114]

    Long short-term memory,

    S. Hochreiter and J. Schmidhuber, “Long short-term memory,”Neural computation, vol. 9, no. 8, pp. 1735–1780, 1997

    1997

  107. [115]

    Collision avoidance among dense heterogeneous agents using deep reinforcement learning,

    K. Zhu, B. Li, W. Zhe, and T. Zhang, “Collision avoidance among dense heterogeneous agents using deep reinforcement learning,”IEEE Robotics and Automation Letters, vol. 8, no. 1, pp. 57–64, 2023

    2023

  108. [116]

    Crowd-robot interaction: Crowd-aware robot navigation with attention-based deep reinforcement learning,

    C. Chen, Y . Liu, S. Kreiss, and A. Alahi, “Crowd-robot interaction: Crowd-aware robot navigation with attention-based deep reinforcement learning,” inInternational Conference on Robotics and Automation, pp. 6015–6022, 2019

    2019

  109. [117]

    Robot navi- gation in crowded environments using deep reinforcement learning,

    L. Liu, D. Dugas, G. Cesari, R. Siegwart, and R. Dub ´e, “Robot navi- gation in crowded environments using deep reinforcement learning,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5671–5677, 2020

    2020

  110. [118]

    ST 2: Spatial- temporal state transformer for crowd-aware autonomous navigation,

    Y . Yang, J. Jiang, J. Zhang, J. Huang, and M. Gao, “ST 2: Spatial- temporal state transformer for crowd-aware autonomous navigation,” IEEE Robotics and Automation Letters, vol. 8, no. 2, pp. 912–919, 2023

    2023

  111. [119]

    Attention is all you need,

    A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in Neural Information Processing Systems, vol. 30, 2017

    2017

  112. [120]

    Relational graph learning for crowd navigation,

    C. Chen, S. Hu, P. Nikdel, G. Mori, and M. Savva, “Relational graph learning for crowd navigation,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 10007–10013, 2020

    2020

  113. [121]

    Decentralized structural-rnn for robot crowd navigation with deep reinforcement learning,

    S. Liu, P. Chang, W. Liang, N. Chakraborty, and K. Driggs-Campbell, “Decentralized structural-rnn for robot crowd navigation with deep reinforcement learning,” inIEEE International Conference on Robotics and Automation, pp. 3517–3524, 2021

    2021

  114. [122]

    Sample-efficient learning-based dynamic environment navigation with transferring expe- rience from optimization-based planner,

    H. Liu, W. Dong, S. Mao, C. Wang, and Y . Gao, “Sample-efficient learning-based dynamic environment navigation with transferring expe- rience from optimization-based planner,”IEEE Robotics and Automa- tion Letters, vol. 9, no. 8, pp. 7055–7062, 2024

    2024

  115. [123]

    Semi-supervised classification with graph convolutional networks,

    T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,”arXiv preprint arXiv:1609.02907, 2016

    2016 arXiv

  116. [124]

    Robot navigation in crowds by graph convolutional networks with attention learned from human gaze,

    Y . Chen, C. Liu, B. E. Shi, and M. Liu, “Robot navigation in crowds by graph convolutional networks with attention learned from human gaze,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 2754–2761, 2020

    2020

  117. [125]

    Structural-RNN: Deep learning on spatio-temporal graphs,

    A. Jain, A. R. Zamir, S. Savarese, and A. Saxena, “Structural-RNN: Deep learning on spatio-temporal graphs,” inIEEE Conference on Computer Vision and Pattern Recognition, pp. 5308–5317, 2016

    2016

  118. [126]

    A two- stage reinforcement learning approach for robot navigation in long- range indoor dense crowd environments,

    X. H. Jing, X. Xiong, F. H. Li, T. Zhang, and L. Zeng, “A two- stage reinforcement learning approach for robot navigation in long- range indoor dense crowd environments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5489–5496, 2024

    2024

  119. [127]

    An environmental-complexity-based navigation method based on hierarchical deep reinforcement learn- ing,

    P. Chen, Q. Liu, Y . Li, and S. Ma, “An environmental-complexity-based navigation method based on hierarchical deep reinforcement learn- ing,” inIEEE International Conference on Robotics and Automation, pp. 5119–5125, 2024

    2024

  120. [128]

    Efficient hierarchical reinforcement learning for mapless navigation with predictive neighbouring space scoring,

    Y . Gao, J. Wu, X. Yang, and Z. Ji, “Efficient hierarchical reinforcement learning for mapless navigation with predictive neighbouring space scoring,”IEEE Transactions on Automation Science and Engineering, vol. 21, no. 4, pp. 5457–5472, 2024

    2024

  121. [129]

    Cooperative motion planning in divided environments via congestion-aware deep reinforcement learn- ing,

    Y . Du, J. Zhang, X. Cheng, and S. Cui, “Cooperative motion planning in divided environments via congestion-aware deep reinforcement learn- ing,”IEEE Robotics and Automation Letters, vol. 10, no. 3, pp. 2295– 2302, 2025

    2025

  122. [130]

    Hierarchical reinforcement learning for safe mapless navigation with congestion estimation,

    J. Gao, X. Pang, Q. Liu, and Y . Li, “Hierarchical reinforcement learning for safe mapless navigation with congestion estimation,” inIEEE International Conference on Robotics and Automation, pp. 8849–8855, 2025

    2025

  123. [131]

    Online context learning for socially compliant navigation,

    I. Okunevich, A. Lombard, T. Krajnik, Y . Ruichek, and Z. Yan, “Online context learning for socially compliant navigation,”IEEE Robotics and Automation Letters, vol. 10, no. 5, pp. 5042–5049, 2025

    2025

  124. [132]

    Addressing function approxi- mation error in actor-critic methods,

    S. Fujimoto, H. Hoof, and D. Meger, “Addressing function approxi- mation error in actor-critic methods,” inInternational Conference on Machine Learning, pp. 1587–1596, PMLR, 2018

    2018

  125. [133]

    Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment,

    L. Chang, L. Shan, C. Jiang, and Y . Dai, “Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment,”Autonomous Robots, vol. 45, pp. 51–76, 2021

    2021

  126. [134]

    Q-learning: Theory and applications,

    J. Clifton and E. Laber, “Q-learning: Theory and applications,”Annual Review of Statistics and Its Application, vol. 7, no. 1, pp. 279–301, 2020

    2020

  127. [135]

    OPPA: Online planner’s parameter adaptation for enhanced mobile robot navigation,

    M. Chang, J. Jang, D. Han, W. Choi, S. Kim, H. Park, and H. Choi, “OPPA: Online planner’s parameter adaptation for enhanced mobile robot navigation,” inIEEE International Conference on Robotics and Automation, pp. 3861–3867, 2025

    2025

  128. [136]

    LiCS: Navigation using learned-imitation on cluttered space,

    J. J. Damanik, J.-W. Jung, C. A. Deresa, and H.-L. Choi, “LiCS: Navigation using learned-imitation on cluttered space,”IEEE Robotics and Automation Letters, vol. 10, no. 2, pp. 2000–2007, 2024

    2000

  129. [137]

    Tra- jectory modification considering dynamic constraints of autonomous robots,

    C. R ¨osmann, W. Feiten, T. W¨osch, F. Hoffmann, and T. Bertram, “Tra- jectory modification considering dynamic constraints of autonomous robots,” inROBOTIK 2012; 7th German Conference on Robotics, pp. 1–6, VDE, 2012

    2012

  130. [138]

    RMRL: Robot navigation in crowd environments with risk map-based deep reinforcement learning,

    H. Yang, C. Yao, C. Liu, and Q. Chen, “RMRL: Robot navigation in crowd environments with risk map-based deep reinforcement learning,” IEEE Robotics and Automation Letters, vol. 8, no. 12, pp. 7930–7937, 2023

    2023

  131. [139]

    Learning implicit social navigation behavior using deep inverse reinforcement learning,

    T. Kathuria, K. Liu, J. Jang, X. J. Yang, and M. Ghaffari, “Learning implicit social navigation behavior using deep inverse reinforcement learning,”IEEE Robotics and Automation Letters, vol. 10, no. 5, pp. 5146–5153, 2025

    2025

  132. [140]

    Proactive model predictive control with multi- modal human motion prediction in cluttered dynamic environments,

    L. Heuer, L. Palmieri, A. Rudenko, A. Mannucci, M. Magnusson, and K. O. Arras, “Proactive model predictive control with multi- modal human motion prediction in cluttered dynamic environments,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 229–236, 2023

    2023

  133. [141]

    Safe planning in dynamic environments using conformal prediction,

    L. Lindemann, M. Cleaveland, G. Shim, and G. J. Pappas, “Safe planning in dynamic environments using conformal prediction,”IEEE Robotics and Automation Letters, vol. 8, no. 8, pp. 5116–5123, 2023

    2023

  134. [142]

    SICNav-Diffusion: Safe and interactive crowd navigation with diffusion trajectory predictions,

    S. Samavi, A. Lem, F. Sato, S. Chen, Q. Gu, K. Yano, A. P. Schoel- lig, and F. Shkurti, “SICNav-Diffusion: Safe and interactive crowd navigation with diffusion trajectory predictions,”IEEE Robotics and Automation Letters, vol. 10, no. 9, pp. 8738–8745, 2025

    2025

  135. [143]

    C. M. Bishop and N. M. Nasrabadi,Pattern recognition and machine learning, vol. 4. Springer, 2006. 21

    2006

  136. [144]

    Deep imitation learning for autonomous navigation in dynamic pedestrian environments,

    L. Qin, Z. Huang, C. Zhang, H. Guo, M. Ang, and D. Rus, “Deep imitation learning for autonomous navigation in dynamic pedestrian environments,” inIEEE International Conference on Robotics and Automation, pp. 4108–4115, 2021

    2021

  137. [145]

    FAPP: Fast and adaptive perception and planning for uavs in dynamic cluttered environments,

    M. Lu, X. Fan, H. Chen, and P. Lu, “FAPP: Fast and adaptive perception and planning for uavs in dynamic cluttered environments,” IEEE Transactions on Robotics, vol. 41, pp. 871–886, 2024

    2024

  138. [146]

    Particle-based instance-aware semantic occupancy mapping in dynamic environ- ments,

    G. Chen, Z. Wang, W. Dong, and J. Alonso-Mora, “Particle-based instance-aware semantic occupancy mapping in dynamic environ- ments,”IEEE Transactions on Robotics, vol. 41, pp. 1155–1171, 2025

    2025

  139. [147]

    PIE: A large-scale dataset and models for pedestrian intention estimation and trajectory prediction,

    A. Rasouli, I. Kotseruba, T. Kunic, and J. K. Tsotsos, “PIE: A large-scale dataset and models for pedestrian intention estimation and trajectory prediction,” inProceedings of the IEEE/CVF International Conference on Computer Vision, pp. 6262–6271, 2019

    2019

  140. [148]

    Trajec- tron++: Dynamically-feasible trajectory forecasting with heterogeneous data,

    T. Salzmann, B. Ivanovic, P. Chakravarty, and M. Pavone, “Trajec- tron++: Dynamically-feasible trajectory forecasting with heterogeneous data,” inComputer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XVIII 16, pp. 683–700, Spri...

    2020

  141. [149]

    Human trajectory forecasting in crowds: A deep learning perspective,

    P. Kothari, S. Kreiss, and A. Alahi, “Human trajectory forecasting in crowds: A deep learning perspective,”IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 7, pp. 7386–7400, 2021

    2021

  142. [150]

    Im- proving pedestrian prediction models with self-supervised continual learning,

    L. Knoedler, C. Salmi, H. Zhu, B. Brito, and J. Alonso-Mora, “Im- proving pedestrian prediction models with self-supervised continual learning,”IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 4781–4788, 2022

    2022

  143. [151]

    Risk-sensitive sequential action control with multi-modal human tra- jectory forecasting for safe crowd-robot interaction,

    H. Nishimura, B. Ivanovic, A. Gaidon, M. Pavone, and M. Schwager, “Risk-sensitive sequential action control with multi-modal human tra- jectory forecasting for safe crowd-robot interaction,” inIEEE/RSJ In- ternational Conference on Intelligent Robots and Systems, pp. 11205– 11...

    2020

  144. [152]

    Denoising diffusion probabilistic models,

    J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,”Advances in Neural Information Processing Systems, vol. 33, pp. 6840–6851, 2020

    2020

  145. [153]

    A tutorial on conformal prediction.,

    G. Shafer and V . V ovk, “A tutorial on conformal prediction.,”Journal of Machine Learning Research, vol. 9, no. 3, 2008

    2008

  146. [154]

    Conformal predic- tive safety filter for RL controllers in dynamic environments,

    K. J. Strawn, N. Ayanian, and L. Lindemann, “Conformal predic- tive safety filter for RL controllers in dynamic environments,”IEEE Robotics and Automation Letters, vol. 8, no. 11, pp. 7833–7840, 2023

    2023

  147. [155]

    Mobile robot path planning in dynamic environments through globally guided reinforcement learn- ing,

    B. Wang, Z. Liu, Q. Li, and A. Prorok, “Mobile robot path planning in dynamic environments through globally guided reinforcement learn- ing,”IEEE Robotics and Automation Letters, vol. 5, no. 4, pp. 6932– 6939, 2020

    2020

  148. [156]

    Deep reinforcement learning with double q-learning,

    H. Van Hasselt, A. Guez, and D. Silver, “Deep reinforcement learning with double q-learning,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 30, 2016

    2016

  149. [157]

    Learning local planners for human-aware navigation in indoor envi- ronments,

    R. Guldenring, M. G ¨orner, N. Hendrich, N. J. Jacobsen, and J. Zhang, “Learning local planners for human-aware navigation in indoor envi- ronments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 6053–6060, 2020

    2020

  150. [158]

    Policy optimization to learn adaptive motion primitives in path planning with dynamic obstacles,

    B. Angulo, A. Panov, and K. Yakovlev, “Policy optimization to learn adaptive motion primitives in path planning with dynamic obstacles,” IEEE Robotics and Automation Letters, vol. 8, no. 2, pp. 824–831, 2023

    2023

  151. [159]

    Risk-sensitive mobile robot navigation in crowded environment via offline reinforce- ment learning,

    J. Wu, Y . Wang, H. Asama, Q. An, and A. Yamashita, “Risk-sensitive mobile robot navigation in crowded environment via offline reinforce- ment learning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 7456–7462, 2023

    2023

  152. [160]

    Frozone: Freezing-free, pedestrian-friendly navigation in human crowds,

    A. J. Sathyamoorthy, U. Patel, T. Guan, and D. Manocha, “Frozone: Freezing-free, pedestrian-friendly navigation in human crowds,”IEEE Robotics and Automation Letters, vol. 5, no. 3, pp. 4352–4359, 2020

    2020

  153. [161]

    DW A-RL: Dynamically feasible deep reinforcement learning policy for robot navigation among mobile obstacles,

    U. Patel, N. K. S. Kumar, A. J. Sathyamoorthy, and D. Manocha, “DW A-RL: Dynamically feasible deep reinforcement learning policy for robot navigation among mobile obstacles,” inIEEE International Conference on Robotics and Automation, pp. 6057–6063, 2021

    2021

  154. [162]

    Multi- agent motion planning for dense and dynamic environments via deep reinforcement learning,

    S. H. Semnani, H. Liu, M. Everett, A. De Ruiter, and J. P. How, “Multi- agent motion planning for dense and dynamic environments via deep reinforcement learning,”IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 3221–3226, 2020

    2020

  155. [163]

    Force-based algorithm for motion planning of large agent,

    S. H. Semnani, A. H. de Ruiter, and H. H. Liu, “Force-based algorithm for motion planning of large agent,”IEEE Transactions on Cybernetics, vol. 52, no. 1, pp. 654–665, 2020

    2020

  156. [164]

    Neural spline flows,

    C. Durkan, A. Bekasov, I. Murray, and G. Papamakarios, “Neural spline flows,”Advances in neural information processing systems, vol. 32, 2019

    2019

  157. [165]

    Lyapunov density models: Constraining distribution shift in learning- based control,

    K. Kang, P. Gradu, J. J. Choi, M. Janner, C. Tomlin, and S. Levine, “Lyapunov density models: Constraining distribution shift in learning- based control,” inInternational Conference on Machine Learning, pp. 10708–10733, PMLR, 2022

    2022

  158. [166]

    Crowd-aware robot nav- igation with switching between learning-based and rule-based methods using normalizing flows,

    K. Matsumoto, Y . Hyodo, and R. Kurazume, “Crowd-aware robot nav- igation with switching between learning-based and rule-based methods using normalizing flows,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4823–4830, 2024

    2024

  159. [167]

    Graph normalizing flows,

    J. Liu, A. Kumar, J. Ba, J. Kiros, and K. Swersky, “Graph normalizing flows,”Advances in Neural Information Processing Systems, vol. 32, 2019

    2019

  160. [168]

    A hierarchical deep reinforcement learning framework with high efficiency and generalization for fast and safe navigation,

    W. Zhu and M. Hayashibe, “A hierarchical deep reinforcement learning framework with high efficiency and generalization for fast and safe navigation,”IEEE Transactions on Industrial Electronics, vol. 70, no. 5, pp. 4962–4971, 2023

    2023

  161. [169]

    Tutorial on variational autoencoders,

    C. Doersch, “Tutorial on variational autoencoders,”arXiv preprint arXiv:1606.05908, 2016

    2016 arXiv

  162. [170]

    Socially compliant navigation through raw depth inputs with generative adversarial im- itation learning,

    L. Tai, J. Zhang, M. Liu, and W. Burgard, “Socially compliant navigation through raw depth inputs with generative adversarial im- itation learning,” inIEEE International Conference on Robotics and Automation, pp. 1111–1117, 2018

    2018

  163. [171]

    Human-inspired multi-agent navigation using knowledge distillation,

    P. Xu and I. Karamouzas, “Human-inspired multi-agent navigation using knowledge distillation,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 8105–8112, 2021

    2021

  164. [172]

    A non-homogeneity mapless navigation based on hierarchical safe reinforcement learning in dy- namic complex environments,

    J. Qin, Q. Liu, Q. Ma, Z. Wu, and J. Qin, “A non-homogeneity mapless navigation based on hierarchical safe reinforcement learning in dy- namic complex environments,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 10237–10244, 2024

    2024

  165. [173]

    Robot navigation in constrained pedestrian environments using reinforcement learning,

    C. P ´erez-D’Arpino, C. Liu, P. Goebel, R. Mart ´ın-Mart´ın, and S. Savarese, “Robot navigation in constrained pedestrian environments using reinforcement learning,” inIEEE International Conference on Robotics and Automation, pp. 1140–1146, 2021

    2021

  166. [174]

    Domain randomization for learning to navigate in human environments,

    N. A. Sen, D. Kuli ´c, and P. Carreno-Medrano, “Domain randomization for learning to navigate in human environments,”IEEE Robotics and Automation Letters, vol. 10, no. 2, pp. 1625–1632, 2025

    2025

  167. [175]

    Diversity-aware crowd model for robust robot navigation in human populated environment,

    J. Wu, Y . Wang, T. Chen, J. Jiang, Y . Wang, Q. An, and A. Ya- mashita, “Diversity-aware crowd model for robust robot navigation in human populated environment,”IEEE Robotics and Automation Letters, vol. 10, no. 6, pp. 6376–6383, 2025

    2025

  168. [176]

    Where to go next: Learning a subgoal recommendation policy for navigation in dynamic environments,

    B. Brito, M. Everett, J. P. How, and J. Alonso-Mora, “Where to go next: Learning a subgoal recommendation policy for navigation in dynamic environments,”IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 4616–4623, 2021

    2021

  169. [177]

    NavRL: Learning safe flight in dynamic environments,

    Z. Xu, X. Han, H. Shen, H. Jin, and K. Shimada, “NavRL: Learning safe flight in dynamic environments,”IEEE Robotics and Automation Letters, vol. 10, no. 4, pp. 3668–3675, 2025

    2025

  170. [178]

    Unsupervised multiple proactive behavior learn- ing of mobile robots for smooth and safe navigation,

    A. Srisuchinnawong, J. Bæch, M. P. Hyzy, T. Kounalakis, E. Boukas, and P. Manoonpong, “Unsupervised multiple proactive behavior learn- ing of mobile robots for smooth and safe navigation,” inIEEE/RSJ In- ternational Conference on Intelligent Robots and Systems, pp. 11796– 11803, 2024

    2024

  171. [179]

    Behavioral cloning from obser- vation,

    F. Torabi, G. Warnell, and P. Stone, “Behavioral cloning from obser- vation,”arXiv preprint arXiv:1805.01954, 2018

    2018 arXiv

  172. [180]

    Generative adversarial imitation learning,

    J. Ho and S. Ermon, “Generative adversarial imitation learning,” Advances in Neural Information Processing Systems, vol. 29, 2016

    2016

  173. [181]

    Distilling the knowledge in a neural network,

    G. Hinton, O. Vinyals, and J. Dean, “Distilling the knowledge in a neural network,”arXiv preprint arXiv:1503.02531, 2015

    2015 arXiv

  174. [182]

    Mapless navigation with safety-enhanced imitation learning,

    C. Yan, J. Qin, Q. Liu, Q. Ma, and Y . Kang, “Mapless navigation with safety-enhanced imitation learning,”IEEE Transactions on Industrial Electronics, vol. 70, no. 7, pp. 7073–7081, 2022

    2022

  175. [183]

    Optimal reciprocal collision avoidance for multiple non- holonomic robots,

    J. Alonso-Mora, A. Breitenmoser, M. Rufli, P. Beardsley, and R. Sieg- wart, “Optimal reciprocal collision avoidance for multiple non- holonomic robots,” inDistributed autonomous robotic systems: The 10th international symposium, pp. 203–216, Springer, 2013

    2013

  176. [184]

    Transfer learning in deep reinforcement learning: A survey,

    Z. Zhu, K. Lin, A. K. Jain, and J. Zhou, “Transfer learning in deep reinforcement learning: A survey,”IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 11, pp. 13344–13362, 2023

    2023

Pith tools

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