#### Filter Results:

- Full text PDF available (35)

#### Publication Year

2000

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- T. K. Satish Kumar
- CP
- 2003

- 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
- AAAI
- 2006

We identify tractable classes of constraints based on the following simple property of a constraint: " At every infeasi-ble 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)

- Shalini Porwal, Tarika Kumar, +7 authors Vipin Chandra Kalia
- Bioresource technology
- 2008

Thirty five bacterial isolates from diverse environmental sources such as contaminated food, nitrogen rich soil, activated sludges from pesticide and oil refineries effluent treatment plants were found to belong to Bacillus, Bordetella, Enterobacter, Proteus, and Pseudomonas sp. on the basis of 16S rRNA gene sequence analysis. Under dark fermentative… (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
- AAAI
- 2004

breakfast = [1, 2] X2 X3 travel = [1, 1] shopping = [2, 5] X4 lunch = [1, 2] [5, inf] X5 X1 sleep = [6, 8] [−inf, 16] X0 Figure 1: Shows an example of the kind of reasoning possible in STPs. The figure is about an agent who should find a schedule for her day's events that satisfies various constraints (indicated by temporal bounds on the edges). Assuming… (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)

- T. K. Satish Kumar
- CPAIOR
- 2005

- Robert Morris, Corina S. Pasareanu, +4 authors Sven Koenig
- AAAI Workshop: Planning for Hybrid Systems
- 2016

- 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 Trav-eling Salesman Problem, Simple Temporal Problems, as well as many of the frameworks described… (More)