#### Filter Results:

- Full text PDF available (45)

#### Publication Year

2000

2017

- This year (11)
- Last 5 years (30)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- T. K. Satish Kumar
- AAAI
- 2006

We identify tractable classes of constraints based on the following simple property of a constraint: “At every infeasible point, there exist two directions such that with respect to any other feasible point, moving along at least one of these two directions decreases a certain distance metric to it”. We show that connected row convex (CRC) constraints,… (More)

- T. K. Satish Kumar
- ICAPS
- 2005

In this paper, we provide a polynomial-time deterministic algorithm, and an even simpler randomized algorithm, for solving a restricted (but very expressive) class of disjunctive temporal problems (DTPs). The general form of a DTP is as follows. We are given a set of events X = {X0,X1 . . .XN} (X0 is the “beginning of the world” node and is set to 0 by… (More)

- T. K. Satish Kumar
- CP
- 2003

- Balamurugan Senthilnayagam, T. K. Satish Kumar, Jayapriya Sukumaran, J. Antonio Zárate M., Ramesh Rao K.
- Pathology research international
- 2012

The granulocytic "shift to left" reflects marrow response to bacterial infection, and this may be quantified as band count or immature granulocyte count (IGC). The former value, used widely in neonatal sepsis, has been notoriously difficult to measure accurately and precisely. A reproducible, precise, and accurate counting of immature granulocyte counts may… (More)

Given the description of a physical system in one of several forms (a set of constraints, Bayesian network etc.) and a set of observations made, the task of model-based diagnosis is to find a suitable assignment to the modes of behavior of individual components (this notion can also be extended to handle transitions and dynamic systems [Kurien and Nayak,… (More)

- T. K. Satish Kumar, Marcello Cirillo, Sven Koenig
- SARA
- 2013

Many real-world applications require the successful combination of spatial and temporal reasoning. In this paper, we study the general framework of the Traveling Salesman Problem with Simple Temporal Constraints. Representationally, this framework subsumes the Traveling Salesman Problem, Simple Temporal Problems, as well as many of the frameworks described… (More)

- Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig
- AAAI
- 2016

We study transportation problems where robots have to deliver packages and can transfer the packages among each other. Specifically, we study the package-exchange robot-routing problem (PERR), where each robot carries one package, any two robots in adjacent locations can exchange their packages, and each package needs to be delivered to a given destination.… (More)

- Wolfgang Hönig, T. K. Satish Kumar, +4 authors Sven Koenig
- ICAPS
- 2016

Multi-Agent Path Finding (MAPF) is well studied in both AI and robotics. Given a discretized environment and agents with assigned start and goal locations, MAPF solvers from AI find collision-free paths for hundreds of agents with userprovided sub-optimality guarantees. However, they ignore that actual robots are subject to kinematic constraints (such as… (More)

- Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig
- IJCAI
- 2016

Multi-Agent Path Finding (MAPF) with the objective to minimize the sum of the travel times of the agents along their paths is a hard combinatorial problem. Recent work has shown that bounded-suboptimal MAPF solvers, such as Enhanced Conflict-Based Search or ECBS(w1) for short, run often faster than optimal MAPF solvers at the cost of incurring a… (More)

- T. K. Satish Kumar
- ISAIM
- 2008

In this paper, we identify rich tractable classes of Weighted Constraint Satisfaction Problems (WCSPs). Our results stem from employing a set of transformation techniques—referred to as “Lifting”—that considers each constraint locally. We show that, in general, WCSPs are reducible to minimum weighted vertex cover problems in tripartite graphs; and many… (More)