A Practical Temporal Constraint Management System for Real-Time Applications

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 553-557

  Hunsberger, Luke ^a  

^a VASSAR COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

ALL PAIRS SHORTEST PATHS; CONSTANT TIME; CONSTRAINT MANAGEMENT; CONSTRAINT PROPAGATION; MANAGEMENT SYSTEMS; PATH INFORMATIONS; REAL-TIME APPLICATION; TEMPORAL CONSTRAINTS; TEMPORAL NETWORKS; TIME POINTS;

GRAPH THEORY;

EID: 85051987536     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-553     Document Type: Conference Paper

References (17)

1. M. Boddy, B. Horling, J. Phelps, R. Goldman, R. Vincent, C. Long, and B. Kohout, ‘C taems language specification, version 1.06 (0)’.
2. Amedeo Cesta and Angelo Oddi, ‘Gaining efficiency and flexibility in the simple temporal problem’, in Proceedings of the Third International Workshop on Temporal Representation and Reasoning (TIME-96), pp. 45–50. IEEE, (1996).
3. Rina Dechter, Itay Meiri, and Judea Pearl, ‘Temporal constraint networks’, Artificial Intelligence, 49, 61–95, (1991).
4. C. Demetrescu and G. Italiano, ‘A new approach to dynamic all pairs shortest paths’, in Proceedings of the 35th STOC, pp. 159–166, (2003).
5. Camil Demetrescu and Giuseppe F. Italiano, ‘Improved bounds and new trade-offs for dynamic all pairs shortest paths’, Technical Report ALCOMFT-TR-02-1, ALCOM, (2002).
6. Shimon Even and Hillel Gazit, ‘Updating distances in dynamic graphs’, Methods of Operations Research, 49, 371–387, (1985).
7. Alfonso Gerevini, Anna Perini, and Francesco Ricci, ‘Incremental algorithms for managing temporal constraints’, Technical Report IRST-9605-07, IRST.
8. Luke Hunsberger, ‘Quantitative temporal reasoning in planning problems’. AAAI-2004 Tutorial MP-2, slides available at: http://www.cs.vassar.edu/hunsberg.
9. Luke Hunsberger, ‘Algorithms for a temporal decoupling problem in multi-agent planning’, in Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), (2002).
10. Luke Hunsberger, Group Decision Making and Temporal Reasoning, Ph.D. dissertation, Harvard University, 2002. Available as Harvard Technical Report TR-05-02.
11. Luke Hunsberger, ‘Distributing the control of a temporal network among multiple agents’, in Proc. of the 2nd Int’l. Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS-03), (2003).
12. G. Ramalingam and Thomas Reps, ‘On the computational complexity of dynamic graph problems’, Theoretical Computer Science, 158, 233–277, (1996).
13. Hans Rohnert, ‘A dynamization of the all pairs least cost path problem’, in 2nd Symposium of Theoretical Aspects of Computer Science (STACS 85), ed., Kurt Mehlhorn, volume 182 of Lecture Notes in Computer Science, 279–286, Springer, (1985).
14. S. Smith, A.T. Gallagher, T.L. Zimmerman, L. Barbulescu, and Z. Rubinstein, ‘Distributed management of flexible times schedules’, in Intl. Conf. on Autonomous Agents and Multiagent Systems, (2007).
15. Valerie Guralnik Thomas Wagner, John Phelps and Ryan VanRiper, ‘COORDINATORS: Coordination managers for first responders’, in Proc. of the 3rd Intl. Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2004). IEEE Computer Society, (2004).
16. Mikkel Thorup, ‘Worst-case update times for fully-dynamic all-pairs shortest paths’, in Annual ACM Symposium on Theory of Computing, pp. 112–119, (2005).
17. Ioannis Tsamardinos, Reformulating Temporal Plans for Efficient Execution, Master’s thesis, University of Pittsburgh, 2000.