Jaein Lim

Orcid: 0000-0003-3057-7997

According to our database1, Jaein Lim authored at least 7 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lazy incremental search for efficient replanning with bounded suboptimality guarantees.
Int. J. Robotics Res., 2024

2023
Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning.
Proceedings of the IEEE International Conference on Robotics and Automation, 2023

2022
CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding.
CoRR, 2022

Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

2021
Class-Ordered LPA*: An Incremental-Search Algorithm for Weighted Colored Graphs.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

2020
MAMS-A*: Multi-Agent Multi-Scale A.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020


  Loading...