Seguir
Tushar Kumar
Tushar Kumar
Georgia Tech, Qualcomm Research
Dirección de correo verificada de gatech.edu
Título
Citado por
Citado por
Año
Multi-agent pathfinding: Definitions, variants, and benchmarks
R Stern, N Sturtevant, A Felner, S Koenig, H Ma, T Walker, J Li, D Atzmon, ...
Proceedings of the International Symposium on Combinatorial Search 10 (1 …, 2019
5612019
Lifelong multi-agent path finding for online pickup and delivery tasks
H Ma, J Li, TK Kumar, S Koenig
arXiv preprint arXiv:1705.10868, 2017
2652017
Lifelong multi-agent path finding in large-scale warehouses
J Li, A Tinka, S Kiesel, JW Durham, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 35 (13), 11272 …, 2021
2042021
Multi-agent path finding with kinematic constraints
W Hönig, TK Kumar, L Cohen, H Ma, H Xu, N Ayanian, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2016
1782016
Multi-agent path finding with payload transfers and the package-exchange robot-routing problem
H Ma, C Tovey, G Sharon, TK Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
1612016
Multi-agent path finding with delay probabilities
H Ma, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
1282017
Overview: Generalizations of multi-agent path finding to real-world scenarios
H Ma, S Koenig, N Ayanian, L Cohen, W Hönig, TK Kumar, T Uras, H Xu, ...
arXiv preprint arXiv:1702.05515, 2017
1102017
Multi-agent path finding with deadlines
H Ma, G Wagner, A Felner, J Li, TK Kumar, S Koenig
arXiv preprint arXiv:1806.04216, 2018
732018
Feasibility study: Moving non-homogeneous teams in congested video game environments
H Ma, J Yang, L Cohen, TK Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence and …, 2017
682017
Optimal and bounded-suboptimal multi-agent motion planning
L Cohen, T Uras, TK Kumar, S Koenig
Proceedings of the International Symposium on Combinatorial Search 10 (1), 44-51, 2019
612019
The FastMap algorithm for shortest path computations
L Cohen, T Uras, S Jahangiri, A Arunasalam, S Koenig, TK Kumar
arXiv preprint arXiv:1706.02792, 2017
422017
Intelligent controller design and fault prediction using machine learning model
K Kumar, SV Pande, T Kumar, P Saini, A Chaturvedi, PCS Reddy, ...
International Transactions on Electrical Energy Systems 2023, 2023
402023
A comprehensive planning framework for electric vehicles fast charging station assisted by solar and battery based on Queueing theory and non-dominated sorting genetic …
N Kumar, T Kumar, S Nema, T Thakur
Journal of Energy Storage 49, 104180, 2022
362022
Method for Opportunistic Computing
S Pande, RE Cledat, T Kumar, J Sreeram
US Patent App. 11/759,200, 2008
342008
Idle time optimization for target assignment and path finding in sortation centers
NM Kou, C Peng, H Ma, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 34 (06), 9925-9932, 2020
292020
Moving agents in formation in congested environments
J Li, K Sun, H Ma, A Felner, TK Kumar, S Koenig
Proceedings of the International Symposium on Combinatorial Search 11 (1 …, 2020
292020
A multiobjective planning framework for EV charging stations assisted by solar photovoltaic and battery energy storage system in coupled power and transportation network
N Kumar, T Kumar, S Nema, T Thakur
International journal of Energy research 46 (4), 4462-4493, 2022
282022
Data management for multiple processing units using data transfer costs
DS Gracia, T Kumar, A Natarajan, R Hastantram, GC Cascaval, H Zhao
US Patent 9,733,978, 2017
272017
Proactive resource management for parallel work-stealing processing systems
H Zhao, DS Gracia, T Kumar
US Patent 10,360,063, 2019
252019
Rapid randomized restarts for multi-agent path finding solvers
L Cohen, G Wagner, D Chan, H Choset, N Sturtevant, S Koenig, ...
Proceedings of the International Symposium on Combinatorial Search 9 (1 …, 2018
202018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20