|
|
Networked
Cyber Physical Systems at SRI |
|
Knowledge-Based Networking á
J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment.
Journal of the ACM, 37:549-587, 1984. Asynchronous Message Passing á
G. Agha.
Actors: a model of concurrent computation in distributed systems.
MIT Press, Cambridge, MA, USA, 1986. á
F. Fich and E. Ruppert.
Hundreds of impossibility results for distributed computing.
Distrib. Comput., 16(2-3):121-163, 2003. á
M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process.
J. ACM, 32(2):374-382, 1985. Group Communication Systems á
L. E. Moser, Y. Amir, P. M. Melliar-Smith, and D.
A. Agarwal.
Extended virtual synchrony.
IEEE 14th International Conference on Distributed Computing Systems,
pages 56-65, 1994. Gossiping Protocols: Surveys
and Models á
K. Birman.
The promise, and limitations, of gossip protocols.
SIGOPS Oper. Syst. Rev., 41(5):8-13, 2007. á
M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen.
Gossip-based peer sampling. ACM Trans.
Comput. Syst., 25(3):8, 2007. á
A.-M. Kermarrec
and M. van Steen.
Gossiping in distributed systems.
SIGOPS Oper. Syst. Rev., 41(5):2-7, 2007. á
Y. Busnel, M. Bertier, and A.-M.
Kermarrec.
Bridging the Gap between Population and Gossip-based Protocols.
Research Report RR-6720, INRIA, 2008. á
Yaacov Fernandess and Antonio Fern‡ndez, and
Maxime Monod.
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Oper. Syst. Rev. vol 41, num 5, pages 19-27, 2007. á
Patrick Eugster, and Pascal Felber, and Fabrice Le
Fessant.
The "art" of programming gossip-based systems,
ACM SIGOPS Oper. Syst. Rev. vol 41, num 5, pages 37-42, 2007. á
P. T. Eugster and R. Guerraoui and A. -M.
Kermarrec and L. MassouliŽ.
From Epidemics to Distributed Computing
IEEE Computer, vol 37, pages 60-67, 2004. Gossip-style Information
Dissemination (Probabilistic Broadcast) á K. P. Birman,
M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast.
ACM Trans. Comput. Syst., 17(2):41-88, 1999. á R. Karp, C.
Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading.
In FOCS '00: The 41st Annual Symposium on Foundations of Computer
Science, page 565. Gossip-style Anti-Entropy
Protocols (Replica Reconciliation) á
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson,
S. Shenker, H. Sturgis, D. Swinehart, D. Terry.
Epidemic algorithms for replicated database maintenance.
In PODC '87: ACM Symposium on Principles of distributed computing,
pages 1-12, 1987. á K. Petersen,
M. J. Spreitzer, D. B. Terry, M. M. Theimer, and A. J. Demers. Flexible update propagation for weakly consistent replication. In SOSP '97: Proceedings of the sixteenth ACM symposium on Operating
systems principles,
pages 288-301. ACM, 1997. á
R. A. Golding and D. D. E. Long.
The performance of weak-consistency replication protocols.
Technical Report UCSC-CRL-92-30, Santa Cruz, CA, USA, 1992. á
R. van Renesse, D.
Dumitriu, V. Gough, and C. Thomas.
Efficient reconciliation and flow control for anti-entropy protocols. In
LADIS '08: 2nd Workshop on Large-Scale Distributed Systems and
Middleware,
pages 1-7. ACM, 2008. Distributed Computation of
Functions using Gossiping (In-Network Computing) á
D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In FOCS '03: The 44th Annual IEEE Symposium on Foundations of Computer
Science,
page 482, Washington, DC, USA, 2003. IEEE
Computer Society. á
T. C. Aysal, M. E. Yildiz, A. D. Sarwate, and A.
Scaglione.
Broadcast gossip algorithms for consensus.
Trans. Sig. Proc., 57(7):2748–2761,
2009. á
O. Babaoglu, G. Canright, A.
Deutsch, G. D. Caro, F. Ducatelle, L. Gambardella, Design patterns from
biology for distributed computing.
In ACM Transactions on Autonomous and Adaptive Systems, 1:26–66,
2006. á
B. Lahiri and S. Tirthapura. Computing
frequent elements using gossip.
In SIROCCO Õ08: International colloquium on Structural Information and
Communication
Complexity, pages 119–130. Springer-Verlag, 2008. á
D. Mosk-Aoyama and D. Shah.
Computing separable functions via gossip.
In PODC Õ06: ACM symposium on Principles of distributed computing,
pages 113–122, New York, NY, USA, 2006.
ACM. Topology-Sensitive Gossiping
Protocols á
D. Kempe, J. Kleinberg, and A. Demers.
Spatial gossip and resource location protocols.
In STOC '01: ACM symposium on Theory of computing, pages 163-172. ACM,
2001. á
J. Acosta-Elias, J. M. Luna-Rivera, M. Recio-Lara,
O. Gutierrez-Navarro, B. Pineda-Reyes.
Topology-sensitive epidemic algorithm for information spreading in
large-scale systems.
Parallel and Distributed Processing and Applications, 4th
International Symposium, ISPAÕ06
Lecture Notes in Computer Science, pages 439-450. Springer, 2006. Applications of Gossiping
Protocols á
R. Van Renesse, K. P. Birman, and W. Vogels.
Astrolabe: A robust and scalable technology for distributed system
monitoring, management, and data mining.
ACM Trans. Comput. Syst., 21(2):164-206,
2003. Semantic Networking and
Stubborn Channels á
J. Pereira, L. Rodrigues, and R. Oliveira.
Semantically reliable multicast: Definition, implementation, and
performance evaluation.
IEEE Trans. Comput., 52(2):150-165, 2003. á
Y. Amir, C. Danilov, S. Goose, D. Hedqvist, and A.
Terzis.
1-800-overlays: using overlay networks to improve VoIP quality.
In NOSSDAV '05: International workshop on Network and operating
systems support for
digital audio and video, pages 51-56, New
York, NY, USA, 2005. ACM. á R. Guerraoui,
R. Olivera, and A. Schiper.
Stubborn communication channels.
Technical report, LSE, D'epartement d'Informatique, Ecole
Polytechnique F'ed'erale de, 1996. Delay- and
Disruption-Tolerant Networking (DTN) á
K. Fall.
A delay-tolerant network architecture for challenged internets.
In SIG-COMM '03: Conference on Applications, technologies,
architectures, and protocols
for computer communications, pages 27-34.
ACM, 2003. á S. Farrell
and V. Cahill.
Delay- and Disruption-Tolerant Networking.
Artech House, Inc., Norwood, MA, USA, 2006. á F. Fich and
E. Ruppert.
Hundreds of impossibility results for distributed computing.
Distrib. Comput., 16(2-3):121-163, 2003. á V. Cerf, S.
Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, E. Travis, H. Weiss.
Status of this memo interplanetary internet (IPN): Architectural
definition,
May 2001. Internet Draft. á
R. Krishnan et al.
The Spindle disruption tolerant networking system.
In Proceedings of IEEE Military Communications Conference, 2007. á M.-O. Stehr and
C. Talcott.
Planning and learning algorithms for routing in disruption-tolerant
networks.
In Proceedings of IEEE Military Communications Conference, 2008. á W. Zhao and
M. H. Ammar.
Message ferrying: Proactive routing in highly partitioned wireless ad
hoc networks.
In FTDCS '03: IEEE Workshop on Future Trends of Distributed Computing
Systems,
page 308, Washington, DC, USA, 2003. IEEE
Computer Society. á W. Zhao, Y.
Chen, M. Ammar, M. Corner, B. Levine, and E. Zegura.
Capacity enhancement using throwboxes in DTNs.
In Proc. IEEE Intl Conf on Mobile Ad-hoc and Sensor Systems (MASS),
pages 31-40, 2006. á
Xu Li, Wei Shu, Minglu Li, Hongyu Huang, and
Min-You Wu.
DTN routing in vehicular sensor networks.
In Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008i,
pages 1–5. á
Z. Guo, G. Colombi, B. Wang, J-H. Cui, D.
Maggiorini and G. Rossi.
Adaptive Routing in Underwater Delay/Disruption Tolerant Sensor
Networks
IEEE/IFIP Conference on Wireless On demand Network Systems and
Services (WONS'08). Content Centric and
Peer-to-Peer Networking á V. Jacobson,
D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L.
Braynard.
Networking named content.
In CoNEXT '09: Conference on Emerging networking experiments and
technologies,
pages 1-12. ACM, 2009. á S.
Androutsellis-Theotokis and D. Spinellis. A survey of peer-to-peer content distribution technologies.
ACM Comput. Surv., 36(4):335-371, 2004. Distributed Hash Tables
(DHT) á
S. Androutsellis-Theotokis and D. Spinellis.
A survey of peer-to-peer content distribution technologies.
ACM Comput. Surv., 36(4):335-371, 2004. á H.
Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica.
Looking up data in p2p systems.
Commun. ACM, 46(2):43-48, 2003. á S. Ratnasamy,
I. Stoica, and S. Shenker.
Routing algorithms for DHTs: Some open questions.
In IPTPS '01: Revised Papers from the First International Workshop on
Peer-to-Peer Systems,
pages 45-52, London, UK, 2002.
Springer-Verlag. á T. Heer, S.
Gotz, S. Rieche, and K. Wehrle.
Adapting distributed hash tables for mobile ad hoc networks.
In PERCOMW '06: IEEE international conference on Pervasive Computing
and
Communications Workshops, page 173. IEEE Computer Society, 2006. á B. Temkow, A.-M. Bosneag, X. Li, and M. Brockmeyer.
PaxonDHT: Achieving consensus in distributed hash tables.
In SAINT '06: Proceedings of the International Symposium on
Applications on Internet, pages 236-244, Washington, DC, USA, 2006. IEEE Computer
Society. á N. A. Lynch, D. Malkhi, and D. Ratajczak.
Atomic Data Access in
Distributed Hash Tables.
IPTPS '01: Revised
Papers from the First International Workshop on Peer-to-Peer Systems,
pages 295-305. Parallel Random Access Model
(PRAM) á
R. Cole and O. Zajicek.
The APRAM: incorporating asynchrony into the PRAM model.
In SPAA '89: ACM symposium on Parallel algorithms and architectures,
pages 169-178. á P. B.
Gibbons.
A more practical PRAM model.
In SPAA '89: ACM symposium on Parallel algorithms and architectures,
pages 158-168. á R. Cole and
O. Zajicek.
The expected advantage of asynchrony.
J. Comput. Syst. Sci., 51(2):286-300, 1995. á M. Herlihy.
Impossibility results for asynchronous PRAM (extended abstract).
In SPAA '91: ACM symposium on Parallel algorithms and architectures,
pages 327-336, New York, NY, USA, 1991. ACM. Distributed and Parallel
Programs á
G. Tel. Introduction to Distributed Algorithms.
Cambridge University Press. 2001 á
L. Lamport.
Time, clocks, and the ordering of events in a distributed system.
Commun. ACM 21, 7 (Jul. 1978), 558-565. á
J. Misra and K. M. Chandy.
Parallel program design: a foundation.
Addison-Wesley Longman Publishing Co., Inc., 1988. á
J.
Misra.
A discipline of multiprogramming: programming theory for distributed
applications.
Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2001. á
J. R. Rao.
Extensions of the Unity Methodology: Compositionality, Fairness and
Probability in Parallelism.
Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1995. á
Andreas Frommer
and Daniel B. Szyld.
On asynchronous iterations J. Comput. Appl. Math., vol 123, num 1-2, pages 201-216, 2000. Self Stabilizing Protocols á
E. W. Dijkstra.
Self-stabilizing systems in spite of distributed control.
Commun. ACM, 17(11):643–644, 1974. á
M. Schneider. Self-stabilization. ACM
Comput. Surv., 25(1):45–67, 1993. á
A. Arora and M. Gouda.
Closure and convergence: A foundation of fault-tolerant computing.
IEEE Transactions on Software Engineering, 19:1015–1027, 1993. á
S. Katz and K. Perry.
Self-stabilizing extensions for message-passing systems.
In PODC Õ90: ACM symposium on Principles of distributed computing,
pages 91–101. ACM, 1990. á
G. Itkis and L. Levin.
Fast and lean self-stabilizing asynchronous protocols,
SFCS '94: The 35th Annual Symposium on Foundations of Computer
Science, pages 226—239. á
Paolo Boldi and Sebastiano Vigna.
Self-Stabilizing Universal Algorithms
Proc. of the 3rd Workshop on Self--Stabilizing Systems, pages
141—156, 1997. á
Angluin, Dana and Aspnes, James and Fischer, Michael
J. and Jiang, Hong.
Self-stabilizing population protocols, ACM
Trans. Auton. Adapt. Syst., vol 3, num 4, pages 1—28. á
S.
Devismes, S. Tixeuil, and M. Yamashita.
Weak vs. Self vs. Probabilistic Stabilization
ICDCS '08: International Conference on Distributed Computing Systems,
pages 681-688. á
Gilbert,
Seth and Lynch, Nancy and Mitra, Sayan and Nolte, Tina.
Self-stabilizing robot formations over unreliable networks
ACM Trans. Auton. Adapt. Syst., 4(3) : 1-29,
2009. á
Dana
Angluin.
Local and global properties in networks of processors (Extended
Abstract),
STOC '80: Proceedings of the twelfth annual ACM symposium on Theory of
computing, pages 82-93. Distributed Shared Memory
(DSM) á
H. Attiya and J. Welch.
Distributed Computing: Fundamentals, Simulations, and Advanced Topics.
Wiley-Interscience, 2004. á
H. E. Bal and A. S.
Tanenbaum.
Distributed programming with shared data
Comput. Lang., 16(2):129-146, 1991. á
R. Bisiani and A. Forin.
Multilanguage parallel programming of heterogeneous machines.
IEEE Trans. Comput., 37(8):930-945, 1988. Petri Net Models á W. Reisig.
Elements of distributed algorithms: modeling and analysis with Petri
nets.
Springer-Verlag New York, Inc., 1998. á H. Všlzer.
Fairness, Randomisierung und Konspiration in verteilten Algorithmen.
PhD thesis, Humboldt-Universitat zu Berlin,
Mathematisch-Naturwissenschaftliche Fakultat II, 2000. á M.-O. Stehr, J. Meseguer, and Peter Csaba …lveczky. Rewriting Logic as a Unifying Framework for Petri nets.
Unifying Petri Nets, pages 250-303, Springer-Verlag, 2001. á
S. Christensen and N. D. Hansen.
Coloured Petri nets extended with place capacities, test arcs and
inhibitor arcs.
In Proceedings of the 14th International Conference on Application and
Theory of Petri Nets,
pages 186-205. Springer-Verlag, 1993. á
W. Vogler.
Partial order semantics and read arcs.
Theor. Comput. Sci., 286(1):33-63, 2002. á
Teruhiro Shimura, Jorge Lobo, and Tadao Murata.
An Extended Petri Net Model for Normal Logic Programs
IEEE Trans. on Knowl. and Data Eng., vol 7,
num 1, pages 150-162, 1995. Tuple Space Models á
R. Bruni and U. Montanari.
Concurrent models for Linda with transactions.
Mathematical. Structures in Comp. Sci., 14(3):421-468,
2004. á
L. Murphy, G. P. Picco, and G.-C.
Roman.
Lime: A coordination model and middleware supporting mobility of hosts
and agents.
ACM
Trans. Softw. Eng. Methodol., 15(3):279-328, 2006. á
S. Bessler, A. Fischer, E. Khn, R. Mordinyi, and
S. Tomic.
Using tuple-spaces to manage the storage and dissemination of
spatial-temporal content.
Journal of Computer and System Sciences, 2009. Blackboard Systems á
R. S. Engelmore and A. Morgan, editors.
Blackboard Systems. Addison-Wesley, 1988. á D. D.
Corkill. Design alternatives for parallel and distributed blackboard systems.
Blackboard Architectures and Applications, pages 99-136. Academic
Press, 1989. á J. R. Ensor
and J. D. Gabbe. Transactional blackboards. In IJCAI'85: Proceedings of the 9th international joint conference on
Artificial intelligence, pages 340-344. Morgan Kaufmann Publishers Inc., 1985. á
V. R. Lesser and D. D. Corkill. Functionally
accurate, cooperative distributed systems. In
Distributed Artificial intelligence, Morgan Kaufmann Publishers, San
Francisco, CA, 295-310, 1988. Equational Logic, Rewriting
Logic, and Maude á
Peter
Padawitz. Computing in
Horn clause theories
Springer-Verlag. 1988. á
M. Clavel, F. Dur‡n, S. Eker, P. Lincoln, N.
Mart’-Oliet, JosŽ Meseguer, and Carolyn Talcott. All about Maude, a high-performance logical framework. Lecture Notes in Computer Science, 4350,
2007. á
J.
Meseguer.
Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96, 1 (Apr. 1992),
73-155. á
G. Agha, J. Meseguer, and K. Sen.
PMaude: Rewrite-based Specification Language for Probabilistic Object
Systems
Electron. Notes Theor. Comput. Sci., 153(2): 213-239, 2006. Probabilistic Logic and
Reasoning á
Joseph
Y. Halpern.
Reasoning about Uncertainty
MIT Press, 2003. á
Joseph
Y. Halpern.
An analysis of first-order logics of probability
In IJCAI-89, 11th International Joint Conference on Artificial
Intelligence, pages 1375-1381. á
Huadong Wu, Mel Siegel, Rainer
Stiefelhagen, and Jie Yang.
Sensor Fusion Using Dempster-Shafer Theory
Proceedings of IEEE Instrumentation and Measurement Technology
Conference, May, 2002. á
E. W. Adams
A Primer of Probability Logic
CSLI Publications, 1998. Distributed Reasoning,
Constraint Solving, and Optimization á
V. K. Janakiram, D. P. Agrawal, and R. Mehrotra.
A randomized parallel backtracking algorithm.
IEEE Trans. Comput.,
37(12):1665–1676, 1988. á
Makoto Yokoo.
Distributed constraint satisfaction: foundations of cooperation in
multi-agent systems.
Springer-Verlag, London, UK, 2001. á
Weixiong Zhang, Guandong Wang, Zhao Xing, and
Lars Wittenburg.
Distributed stochastic search and distributed breakout: properties,
comparison
and applications to constraint optimization
problems in sensor networks.
Artif. Intell., 161(1-2):55–87, 2005. á
Roger Mailler and Victor Lesser.
Solving distributed constraint optimization problems using cooperative
mediation.
In AAMAS Õ04: Proceedings of the Third International Joint Conference
on Autonomous
Agents and Multiagent Systems, pages 438–445, Washington, DC,
USA, 2004. á
Wolfgang Blochinger.
Towards robustness in parallel SAT solving
In PARCO, volume 33 of John von Neumann Institute for Computing
Series,
pages 301–308. Central Institute for
Applied Mathematics, JŸlich, Germany, 2005. á
Wahid Chrabakh and Rich Wolski.
GridSAT: A Chaff-based distributed SAT solver for the Grid.
In SC Õ03: ACM/IEEE conference on Supercomputing, page 37. Sensor
and Actor Networks á
Falko Dressler.
Self-Organization in Sensor and Actor Networks.
Wiley, 2008. á
Chalermek Intanagonwiwat, Ramesh Govindan,
Deborah Estrin, John Heidemann, and Fabio Silva.
Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Netw., 11(1):2–16, 2003. á
Kemal Akkaya and Mohamed Younis.
A survey on routing protocols for wireless sensor networks.
Ad Hoc Networks, 3:325–349, 2005. á
Ian F. Akyildiz and Ismail H. Kasimoglu.
Wireless sensor and actor networks: Research challenges.
Ad Hoc Networks, 2(4):351–367, 2004. á
Tommaso Melodia, Dario Pompili, Vehbi C. Gungor,
and Ian F. Akyildiz.
Communication and coordination in wireless sensor and actor networks.
IEEE Transactions on Mobile Computing, 6(10):1116–1129,
2007. á
Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua.
Using mobile relays to prolong the lifetime of wireless sensor
networks.
In MobiCom Õ05: The 11th international conference on Mobile
computing and networking,
pages 270–283, New York, NY, USA, 2005.
ACM. á
Deborah
Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar.
Next Century Challenges: Scalable Coordination in Sensor Networks.
ACM/IEEE International Conference on Mobile Computing and Networking, pp. 263-270. Seattle, Washington, USA, ACM. August, 1999. á
Guangyu
Pei Mario, Mario Gerla, and Tsu-wei Chen.
Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks
In Proceedings of ICC 2000, pages 70-74. á
B.
Banhelyi, M. Biazzini, A. Montresor and M. Jelasity.
Peer-to-peer Optimization in Large Unreliable Networks with
Branch-and-Bound and Particle Swarms
In Proceedings of the Evoworkshops 2009 on Applications of
Evolutionary Computing. Knowledge-Based
and Declarative Approaches to Networking á
David Chu, Lucian Popa, Arsalan Tavakoli, Joseph
M. Hellerstein, Philip Levis, Scott Shenker, and Ion Stoica.
The design and implementation of a declarative sensor network system.
In SenSys '07: International Conference on Embedded Networked Sensor
Systems,
pages 175-188, 2007. á
Boon Thau Loo, Tyson Condie, Minos Garofalakis,
David E. Gay, Joseph M. Hellerstein,
Declarative networking: language, execution and optimization
SIGMOD '06: ACM SIGMOD international conference on Management of data,
pages 97—108. á
C. Liu, Y. Mao, M. Oprea, P. Basu, and
B. T. Loo. A
declarative perspective on adaptive MANET routing. á M.-O. Stehr and
C. Talcott.
Planning and learning algorithms for routing in disruption-tolerant
networks.
In Proceedings of IEEE Military Communications Conference, 2008. á
D. Elenius, G. Denker, and M.-O.
Stehr. A Semantic Web Reasoner for Rules,
Equations and Constraints.
In Proceedings
of the 2nd international Conference on Web Reasoning and Rule Systems.
Lecture Notes In Computer Science, vol. 5341. Springer-Verlag, pages
135-149. á
Prithwish Basu, Rajesh Krishnan, and Daniel Brown,
ÒPersistent Delivery with Deferred Binding to
Meld: A Declarative Approach to Programming Ensembles.
In Proceedings of the
IEEE International Conference on Intelligent Robots and Systems (IROS '07)
Mobile Robot Teams á
Charles L. Ortiz, RŽgis Vincent, and Benoit
Morisset.
Task inference and distributed task management in the Centibots
robotic system.
In AAMAS
Õ05: Proceedings of the fourth international joint conference on Autonomous agents
and multiagent systems, pages
860–867, New York, NY, USA, 2005. ACM. á
Brian P. Gerkey, Roger Mailler, and Benoit
Morisset.
Commbots: Distributed control of mobile communication relays.
In Proc.
of the AAAI Workshop on Auction Mechanisms for Robot Coordination (AuctionBots),
page 5157, Boston, Massachusetts, July 2006. á
R. B. Rusu, A. Maldonado, M. Beetz,
and B. Gerkey.
Extending Player/Stage/Gazebo towards cognitive robots acting in
ubiquitous
sensor-equipped environments, IEEE International Conference on
Robotics and Automation
Workshop for Network Robot Systems, 2007. á
R. Alur, A. K. Das, J. M. Esposito,
R. B. Fierro, G. Z. Grudic, Y. Hur, V. Kumar, I. Lee, J. P. Lee,
A Framework and Architecture for Multirobot Coordination,
ISER '00: Experimental Robotics VII, pages 303-312. á L. Steels.
Cooperation between distributed agents through self-organisation, Y. Demazeau
and J.-P. MŸller, eds., Decentralized AI Elsevier, 175-196,
1990. á Lynne E. Parker.
An architecture for fault tolerant multirobot cooperation,
IEEE Transactions on Robotics and Automation, vol. 14, pages 220-240,
1998. á
D. Goldberg, V. Cicirello, M B.
Dias, R. Simmons, S. Smith and A. (Tony) Stentz.
Market-Based Multi-Robot Planning in a Distributed Layered
Architecture
In the 2003 International Workshop on Multi-Robot Systems, pages
27-38. á
Jiming Liu and Jianbing Wu.
Multi-agent Robotic Systems,
CRC Press, 2001. Simultaneous Localization
and Mapping (SLAM) á
Howie Choset and K. Nagatani.
Topological simultaneous localization and mapping (SLAM): Toward exact localization without explicit localization.
IEEE Trans. on Robotics and Automation, 17(1):125
-137, April 2001. á
Giorgio Grisetti, Cyrill Stachniss, and Wolfram
Burgard.
Nonlinear constraint network optimization for efficient map learning.
Trans. Intell. Transport. Sys.,
10(3):428-439, 2009. Other
Application Domains á
Gregory D. Troxel et al.
Enabling open-source cognitively-controlled
collaboration among software-defined radio nodes.
Comput. Netw., 52(4):898-911, 2008. á
S. Toorian, K. Diaz, S. Lee.
The CubeSet approach to space access.
In Aerospace Conference, IEEE, 2008. |
||||||||||||||||||||
|
|
|
||||||||||||||||||||
Last updated: July
12, 2010