-
1
-
-
0029537980
-
Issues and approaches in the design of collective autonomous agents
-
M. Matarić, "Issues and approaches in the design of collective autonomous agents," Robotics and Autonomous Systems, vol. 16, pp. 321-331, 1995.
-
(1995)
Robotics and Autonomous Systems
, vol.16
, pp. 321-331
-
-
Matarić, M.1
-
2
-
-
0034205975
-
Multiagent systems: A survey from a machine learning perspective
-
P. Stone and M. Veloso, "Multiagent systems: A survey from a machine learning perspective," Autonomous Robots, vol. 8, no. 3, 2000.
-
(2000)
Autonomous Robots
, vol.8
, Issue.3
-
-
Stone, P.1
Veloso, M.2
-
3
-
-
0348040387
-
Robot exploration with combinatorial auctions
-
M. Berhault, H. Huang, P. Keskinocak, S. Koenig, W. Elmaghraby, P. Griffin, and A. Kleywegt, "Robot exploration with combinatorial auctions," in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003, pp. 1937-1962.
-
(2003)
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems
, pp. 1937-1962
-
-
Berhault, M.1
Huang, H.2
Keskinocak, P.3
Koenig, S.4
Elmaghraby, W.5
Griffin, P.6
Kleywegt, A.7
-
4
-
-
85094846207
-
Coordination for multi-robot exploration and mapping
-
R. Simmons, D. Apfelbaum, W. Burgard, D. Fox, M. Moors, S. Thrun, and H. Younes, "Coordination for multi-robot exploration and mapping," in Proceedings of the National Conference on Artificial Intelligence, 2000, pp. 852-858.
-
(2000)
Proceedings of the National Conference on Artificial Intelligence
, pp. 852-858
-
-
Simmons, R.1
Apfelbaum, D.2
Burgard, W.3
Fox, D.4
Moors, M.5
Thrun, S.6
Younes, H.7
-
5
-
-
0008578565
-
Multi-agent path planning based on task-swap negotiation
-
M. Golfarelli, D. Maio, and S. Rizzi, "Multi-agent path planning based on task-swap negotiation," in Proceedings of the UK Planning and Scheduling SIG Workshop, 1997, pp. 69-82.
-
(1997)
Proceedings of the UK Planning and Scheduling SIG Workshop
, pp. 69-82
-
-
Golfarelli, M.1
Maio, D.2
Rizzi, S.3
-
6
-
-
0033705648
-
A comparison of coordinated planning methods for cooperating rovers
-
G. Rabideau, T. Estlin, S. Chien, and A. Barrett, "A comparison of coordinated planning methods for cooperating rovers," in Proceedings of the Fourth International Conference on Autonomous Agents, 2000, pp. 100-101.
-
(2000)
Proceedings of the Fourth International Conference on Autonomous Agents
, pp. 100-101
-
-
Rabideau, G.1
Estlin, T.2
Chien, S.3
Barrett, A.4
-
7
-
-
0037845207
-
Market-driven multi-robot exploration
-
Robotics Institute, Carnegie Mellon University, Pittsburgh, PA
-
R. Zlot, A. Stentz, M. Dias, and S. Thayer, "Market-driven multi-robot exploration," Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. CMU-RI-TR-02-02, 2002.
-
(2002)
Tech. Rep.
, vol.CMU-RI-TR-02-02
-
-
Zlot, R.1
Stentz, A.2
Dias, M.3
Thayer, S.4
-
8
-
-
0036817317
-
Sold! Auction methods for multi-robot coordination
-
B. Gerkey and M. Materić, "Sold! Auction methods for multi-robot coordination," IEEE Transactions on Robotics and Automation, vol. 18, no. 5, pp. 758-768, 2002.
-
(2002)
IEEE Transactions on Robotics and Automation
, vol.18
, Issue.5
, pp. 758-768
-
-
Gerkey, B.1
Materić, M.2
-
9
-
-
0036057587
-
Multi-robot exploration controlled by a market economy
-
R. Zlot, A. Stentz, M. Dias, and S. Thayer, "Multi-robot exploration controlled by a market economy," in Proceedings of the IEEE International Conference on Robotics and Automation, 2002, pp. 3016-3023.
-
(2002)
Proceedings of the IEEE International Conference on Robotics and Automation
, pp. 3016-3023
-
-
Zlot, R.1
Stentz, A.2
Dias, M.3
Thayer, S.4
-
13
-
-
0003408279
-
-
Wiley
-
E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, Eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, 1985.
-
(1985)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
-
-
Lawler, E.1
Lenstra, J.2
Rinnooy Kan, A.3
Shmoys, D.4
-
14
-
-
0015604699
-
An effective heuristic algorithm for the traveling-salesman problem
-
S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, vol. 21, pp. 498516, 1973.
-
(1973)
Operations Research
, vol.21
, pp. 498516
-
-
Lin, S.1
Kernighan, B.2
-
16
-
-
84911584312
-
Shortest connection networks and some generalizations
-
R. C. Prim, "Shortest connection networks and some generalizations." Bell Systems Technical Journal, pp. 1389-1401, 1957.
-
(1957)
Bell Systems Technical Journal
, pp. 1389-1401
-
-
Prim, R.C.1
-
17
-
-
0003522092
-
Worst-case analysis of a new heuristic for the travelling salesman problem
-
Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA
-
N. Christofides, "Worst-case analysis of a new heuristic for the travelling salesman problem," Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. 388, 1976.
-
(1976)
Tech. Rep.
, vol.388
-
-
Christofides, N.1
|