◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. K. Satish Kumar

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.AI1
  • cs.RO1
ORCID 0000-0002-1748-8431

identity via Semantic Scholar / OpenAlex

most citedMulti-Agent Path Finding with Delay Probabilities

28 citations · 28 across the 2 of their papers we have counts for

collaborators

2 papers

cs.RO2024

Caching-Augmented Lifelong Multi-Agent Path Finding

Yimin Tang, Zhenghong Yu, Yi Zheng +3

Multi-Agent Path Finding (MAPF), which involves finding collision-free paths for multiple robots, is crucial in various applications. Lifelong MAPF, where targets are reassigned to…

cs.AI2016★ 28 cited

Multi-Agent Path Finding with Delay Probabilities

Hang Ma, T. K. Satish Kumar, Sven Koenig

Several recently developed Multi-Agent Path Finding (MAPF) solvers scale to large MAPF instances by searching for MAPF plans on 2 levels: The high-level search resolves collisions…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.