E-LIB Suche - Ergebnisse für: Harabor, Daniel D

1

Guards: Benchmarks for weighted grid-based pathfinding:

Moghadam, Sajjad Kardani ; Ebrahimi, Morteza ; Harabor, Daniel D.
Expert Systems with Applications. 249 (2024) - p. 123719 , 2024

Link: https://doi.org/10.1016/..

2

Snapshot-Optimal Real-Time Ride Sharing:

Hassan, Afzaal ; Wallace, Mark ; Moser, Irene.
Information. 15 (2024) 4 - p. 174 , 2024

Link: https://doi.org/10.3390/..

3

Enhanced methods for the weight constrained shortest path p..:

Ahmadi, Saman ; Tack, Guido ; Harabor, Daniel..
Networks. 84 (2024) 1 - p. 3-30 , 2024

Link: https://doi.org/10.1002/..

4

Optimal Routing for Autonomous Vehicles in a Mixed Congeste..:

, In: 2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC),

Davoodi, Ali ; Wallace, Mark ; Harabor, Daniel. - p. 1870-1875 , 2023

Link: https://doi.org/10.1109/..

5

Fast optimal and bounded suboptimal Euclidean pathfinding:

Shen, Bojie ; Cheema, Muhammad Aamir ; Harabor, Daniel D..
Artificial Intelligence. 302 (2022) - p. 103624 , 2022

Link: https://doi.org/10.1016/..

6

Branch-and-cut-and-price for multi-agent path finding:

Lam, Edward ; Le Bodic, Pierre ; Harabor, Daniel.
Computers & Operations Research. 144 (2022) - p. 105809 , 2022

Link: https://doi.org/10.1016/..

7

Anytime Multi-Agent Path Finding via Large Neighborhood Sea..:

, In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems,

Li, Jiaoyang ; Chen, Zhe ; Harabor, Daniel.. - p. 1581-1583 , 2021

Link: https://dl.acm.org/doi/1..

8

Pairwise symmetry reasoning for multi-agent path finding se..:

Li, Jiaoyang ; Harabor, Daniel ; Stuckey, Peter J....
Artificial Intelligence. 301 (2021) - p. 103574 , 2021

Link: https://doi.org/10.1016/..

9

Peak-Hour Rail Demand Shifting with Discrete Optimisation:

, In: Lecture Notes in Computer Science; Principles and Practice of Constraint Programming,

Betts, John M. ; Dowe, David L. ; Guimarans, Daniel... - p. 748-763 , 2019

Link: https://doi.org/10.1007/..

10

Fast Algorithm for Catching a Prey Quickly in Known and Par..:

Baier, Jorge A. ; Botea, Adi ; Harabor, Daniel.
IEEE Transactions on Computational Intelligence and AI in Games. 7 (2015) 2 - p. 193-199 , 2015

Link: https://doi.org/10.1109/..

11

Tracking Progress in Multi-Agent Path Finding:

Shen, Bojie ; Chen, Zhe ; Cheema, Muhammad Aamir..
http://arxiv.org/abs/2305.08446. , 2023

Link: http://arxiv.org/abs/230..

12

Scalable Rail Planning and Replanning with Soft Deadlines:

Chen, Zhe ; Li, Jiaoyang ; Harabor, Daniel.
http://arxiv.org/abs/2306.06455. , 2023

Link: http://arxiv.org/abs/230..

13

Traffic Flow Optimisation for Lifelong Multi-Agent Path Fin..:

Chen, Zhe ; Harabor, Daniel ; Li, Jiaoyang.
http://arxiv.org/abs/2308.11234. , 2023

Link: http://arxiv.org/abs/230..

14

Reducing Redundant Work in Jump Point Search:

Zhao, Shizhe ; Harabor, Daniel ; Stuckey, Peter J
http://arxiv.org/abs/2306.15928. , 2023

Link: http://arxiv.org/abs/230..

15

The JPS pathfinding system in 3D:

Nobes, Thomas K ; Harabor, Daniel ; Wybrow, Michael.
Nobes , T K , Harabor , D , Wybrow , M & Walsh , S D C 2022 , The JPS pathfinding system in 3D . in L Chrpa & A Saetti (eds) , Proceedings of the International Symposium on Combinatorial Search . Fifteenth InternationalSymposium on Combinatorial Search , no. 1 , vol. 15 , Association for the Advancement of Artificial Intelligence (AAAI) , Palo Alto CA USA , pp. 145-152 , International Symposium on Combinatorial Search 2022 , Vienna , Austria , 21/07/22 .. , 2022

Link: https://research.monash...