An optimal temporally expressive planner: Initial results and application to P2P network optimization

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 178-185

  Huang, Ruoyun ^a   Chen, Yixin ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION PROTOCOLS; OPTIMAL COMMUNICATION; P2P NETWORK; PLANNING PROBLEM; PROBLEM DOMAIN; TEMPORAL PLANNING; TIME SPAN;

COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; PLANNING; SCHEDULING;

PEER TO PEER NETWORKS;

EID: 78650622661     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bhattacharya, A., and Ghosh, S. 2007. Self-optimizing peer-to-peer networks with selfish processes. In Proc. of Int'l Conf. on Self-Adaptive and Self-Organizing Systems. (Pubitemid 350244584)
2. Chen, Y.; Huang, R.; Xing, Z.; and Zhang, W. 2009. Long-distance mutual exclusion for planning. Artificial Intelligence 173:197-412.
3. Coles, A.; Fox, M.; Halsey, K.; Long, D.; and Smith, A. 2008a. Managing concurrency in temporal planning using planner-scheduler interaction. Artificial Intelligence 173:1-44.
4. Coles, A.; Fox, M.; Long, D.; and Smith, A. 2008b. Planning with problems requiring temporal coordination. In Proc. of AAAI-08.
5. Cushing, W.; Kambhampati, S.; Mausam; and Weld, D. S. 2007a. When is temporal planning really temporal? In Proc. of Int'l Joint Conf. on AI.
6. Cushing, W.; Kambhampati, S.; Talamadupula, K.; Weld, D. S.; and Mausam. 2007b. Evaluating temporal planning domains. In Proc. of ICAPS-07.
7. Een, N., and Sörensson, N. 2003. An Extensible SAT-solver.
8. Giunchiglia, E., and Maratea, M. 2007. Planning as satisfiability with preferences. In Proc. of AAAI-07.
9. Helmert, M. 2008. Concise finite-domain representations for pddl planning tasks. Artificial Intelligence 503-535.
10. Hu, Y. 2007. Temporally-expressive planning as constraint satisfaction problems. In Proc. of ICAPS-07.
11. Kautz, H.; Selman, B.; and Hoffmann, J. 1999. Unifying sat-based and graph-based planning. In Proc. of Int'l Joint Conf. on AI.
12. Long, D., and Fox, M. 2003. Exploiting a graphplan framework in temporal planning. In Proc. of Int'l Conf. on Automated Planning and Scheduling.
13. Mattmüller, R., and Rintanen, J. 2007. Planning for temporally extended goals as propositional satisfiability. In Proc. of Int'l Joint Conf on AI.
14. Pham, D.; Thornton, J.; and Sattar, A. 2008. Modelling and solving temporal reasoning as propositional satisfiability. Artificial Intelligence 172:1752-1782.
15. Ray, K., and Ginsberg, M. L. 2008. The complexity of optimal planning and a more efficient method for finding solutions. In Proc. of Int'l Conf. on Automated Planning and Scheduling.
16. Rintanen, J. 2007. Complexity of concurrent temporal planning. In Proc. of AAAI-07.
17. Robinson, N.; Gretton, C.; Pham, D.; and Sattar, A. 2008. A compact and efficient sat encoding for planning. In Proc. of ICAPS-08.
18. Rudenko, A. 2002. Automated Planning for Open Network Architectures. Ph.D. Dissertation, UCLA.
19. Smith, D., and Weld, D. 1999. Temporal planning with mutual exclusion reasoning. In Proc. of Int'l Joint Conf. on AI.
20. Subramanian, R., and Goodman, B. D. 2005. Peer to Peer Computing: The Evolution of a Disruptive Technology. IGI Publishing.
21. Vidal, V., and Geffner, H. 2006. Branching and pruning: An optimal temporal pocl planner based on constraint programming. Artificial Intelligence 170:98-335. (Pubitemid 43134175)
22. Wah, B. W., and Chen, Y. 2006. Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence 170:187-231. (Pubitemid 43134174)
23. Zhang, H.; Goel, A.; and Govindan, R. 2009. An empirical evaluation of internet latency expansion. ACM SIGCOMM Computer Comms. Review to appear.