| 1. |
- Kumar, T. K. Satish, et al.
(författare)
-
On the Traveling Salesman Problem with Simple Temporal Constraints
- 2013
-
Ingår i: Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation (SARA). - : AAAI Press. - 9781577356301
-
Konferensbidrag (refereegranskat)abstract
- 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 in the literature. We analyze the theoretical properties of the combined problem providing strong inapproximability results for the general problem, and positive results for some special cases.
|
|
| 2. |
- Kumar, T. K. Satish, et al.
(författare)
-
Simple Temporal Problems with Taboo Regions
- 2013
-
Ingår i: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI). - : AAAI Press.
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we define and study the general framework of Simple Temporal Problems with Taboo regions (STPTs) and show how these problems capture metric temporal reasoning aspects which are common to many real-world applications. STPTs encode simple temporal constraints between events and user-defined taboo regions on the timeline, during which no event is allowed to take place. We discuss two different variants of STPTs. The first one deals with (instantaneous) events, while the second one allows for (durative) processes. We also provide polynomial-time algorithms for solving them. If all events or processes cannot be scheduled outside of the taboo regions, one needs to define and reason about "soft" STPTs. We show that even "soft" STPTs can be solved in polynomial time, using reductions to max-flow problems. The resulting algorithms allow for incremental computations, which is important for the successful application of our approach in real-time domains.
|
|
