Bojie Shen

Zhe Chen

CoRR, 2023

Tracking Progress in Multi-Agent Path Finding (Student Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Efficient Object Search in Game Maps.

[BibT_eX]

[DOI]

Jinchun Du

Shizhe Zhao

Adel Nadjaran Toosi

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Beyond Pairwise Reasoning in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Zhe Chen

Jiaoyang Li

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Ultrafast Euclidean Shortest Path Computation Using Hub Labeling.

[BibT_eX]

[DOI]

Jinchun Du

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Fast optimal and bounded suboptimal Euclidean pathfinding.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Improving Time-Dependent Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Contracting and Compressing Shortest Path Databases.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Direction-based spatial skyline for retrieving surrounding objects.

[BibT_eX]

[DOI]

World Wide Web, 2020

Efficient processing of reverse nearest neighborhood queries in spatial databases.

[BibT_eX]

[DOI]

Inf. Syst., 2020

Direction-based Spatial Skyline for Retrieving Arbitrary-Shaped Surrounding Objects.

[BibT_eX]

[DOI]

Md. Saiful Islam

David Taniar

Comput. J., 2020

Euclidean Pathfinding with Compressed Path Databases.

[BibT_eX]

[DOI]

Daniel Harabor