Multi-agent learning in mobilized ad-hoc networks

AAAI Fall Symposium - Technical Report

Volumn FS-04-02, Issue , 2004, Pages 81-88

  Chang, Yu Han ^a   Ho, Tracey ^b   Kaelbling, Leslie Pack ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC NETWORKS; COORDINATION SIGNALS; MOVEMENT POLICIES; MULTI-AGENT LEARNING;

COMPUTER NETWORKS; DECISION THEORY; DISTRIBUTED COMPUTER SYSTEMS; LEARNING ALGORITHMS; PACKET NETWORKS; ROUTERS;

MULTI AGENT SYSTEMS;

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

References (17)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 1995. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science.
2. Boyan, J., and Littman, M. L. 1994. Packet routing in dynamically changing networks: A reinforcement learning approach. In Advances in NIPS.
3. Chang, Y.; Ho, T.; and Kaelbling, L. P. 2004. All learning is local: Multiagent learning in global reward games. In Advances in Neural Information Processing Systems (NIPS03).
4. Chatzigiannakis, I.; Nikoletseas, S.; Paspallis, N.; Spirakis, P.; and Zaroliagis, C. 2001. An experimental study of basic communication protocols in ad-hoc mobile networks. In 5th Workshop on Algorithmic Engineering.
5. Chen, B.; Jamieson, K.; Balakrishnan, H.; and Morris, R. 2001. Span: An energy-efficient coordination algorithm for topology maintenance. In SIGMOBILE.
6. Choi, S.; Yeung, D.; and Zhang, N. 1999. Hidden-mode Markov decision processes. In IJCAI Workshop on Neural, Symbolic, and Reinforcement Methods for Sequence Learning.
7. Grossglauser, M., and Tse, D. 2001. Mobility increases the capacity of ad-hoc wireless networks. In INFOCOM.
8. Johnson, D., and Maltz, D. 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, volume 353.
9. Kalman, R. E. 1960. A new approach to linear filtering and prediction problems. Transactions of the American Society of Mechanical Engineers, Journal of Basic Engineering.
10. Li, Q., and Rus, D. 2000. Sending messages to mobile users in disconnected ad-hoc networks. In MOBICOM.
11. Littman, M. L., and Szepesvári, C. 1996. A generalized reinforcement-learning model: Convergence and applications. In Proc. of the 13th ICML.
12. Mannor, S., and Shimkin, N. 2001. Adaptive strategies and regret minimization in arbitrarily varying Markov environments. In Proc. of 14th COLT.
13. Ng, A. Y.; Harada, D.; and Russell, S. 1999. Policy invariance under reward transformations: theory and application to reward shaping. In Proc. 16th ICML.
14. Perkins, C., and Royer, E. 1997. Ad-hoc on-demand distance vector routing. In MILCOM Panel.
15. Peshkin, L. 2002. Reinforcement learning by policy search. Ph.D. Thesis, MIT.
16. Szita, I.; Takacs, B.; and Lorincz, A. 2002. e-mdps: Learning in varying environments. Journal of Machine Learning Research.
17. Watkins, C. J. 1989. Learning with delayed rewards. Ph.D. Thesis, University of Cambridge.