Nomadic routing applications for wireless networking in a team of miniature robots

Budenske, John; Bonney, J.; Ahamad, A.; Ramanujan, R.V.; Hougen, Dean F.; Papanikolopoulos, N.

doi:10.1109/icsmc.2000.886515

Cited by 4 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some works in the literature implement policy-based approaches for multi-hop routing for collaborative vehicles. For example, references [32] and [33] emphasize the importance of policy based routing schemes for collaborative robots and propose a routing protocol called the source-initiated adaptive routing algorithm (SARA). Based on the symmetry of links in the networks, SARA can switch between policy-based routing and best-effort routing.…”

Section: Routing Schemes For Collaborative Vehiclesmentioning

confidence: 99%

Communication network challenges for collaborative vehicles

Chen

Hovareshti

Baras

2011

2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

View full text Add to dashboard Cite

Networked systems of autonomous mobile agents have emerged in a variety of applications such as collaborative robotics, unmanned aerial/ground vehicles, mobile sensor networks and disaster relief operations. These agents utilize wireless communications for distributed computing, control and decision-making. Due to their limitations on energy supply, design and implementation of efficient distributed algorithms are crucial for these systems. This paper reviews different design aspects of networks of collaborative vehicles. We survey existing methods of addressing physical (PHY) and medium access control (MAC) layer, routing, and geometric connectivity issues for such networks and show limitations of these designs that address only single layer issues. We argue that a system engineering framework is needed for the design of such systems.

show abstract

Section: Routing Schemes For Collaborative Vehiclesmentioning

confidence: 99%

Communication network challenges for collaborative vehicles

Chen

Hovareshti

Baras

2011

2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

View full text Add to dashboard Cite

show abstract

“…There is no attempt in these protocols to do routing based on Quality of Service (QoS) metrics. Works that are in the literature on routing schemes for multi-robot network systems include [6], [9] and [1]. The papers [6], [9] emphasize the importance and the need for developing policy based routing schemes for such systems.…”

Section: Introductionmentioning

confidence: 99%

“…Works that are in the literature on routing schemes for multi-robot network systems include [6], [9] and [1]. The papers [6], [9] emphasize the importance and the need for developing policy based routing schemes for such systems. These papers propose a routing protocol called the Source-Initiated Adaptive Routing Algorithm (SARA) that can switch between policybased routing and best-effort routing depending on whether the network has symmetric or asymmetric links.…”

Section: Introductionmentioning

confidence: 99%

A policy-based routing scheme for multi-robot systems

Purkayastha

Hovareshti

Baras

2008

2008 16th Mediterranean Conference on Control and Automation

View full text Add to dashboard Cite

In this paper we consider a policy-based routing scheme for a wireless communication network consisting of a set of robots as nodes. Our scheme provides a communication infrastructure that enables the multi-robot system to accomplish its assigned tasks. Our scheme is adaptive and can be implemented in a distributed manner by the nodes of the network. The scheme makes estimates of link and path costs in the network and uses these estimates to construct probabilistic routing tables in the nodes. We use ideas from the literature on simulation methods for approximate dynamic programming to compute, in a distributed manner, the cost estimates. We propose two schemes that update the probabilistic routing tables at the nodes of the network. One of the schemes is an adaptation of the Linear Reward Inaction rule found in studies of stochastic learning automata. Our other scheme is a modification of an Ant-Based Routing algorithm. We assume a simple model of the link behavior in the wireless network -a message transmission on a wireless link is assumed to be successful with a certain probability and is lost otherwise. We also analyze our algorithms and show that our probabilistic update schemes direct packets along paths with low costs.

show abstract

Collective robotics - a survey of control and communication techniques

Dutta¹,

Bogobowicz²,

Gu³

2004 International Conference on Intelligent Mechatronics and Automation, 2004. Proceedings.

View full text Add to dashboard Cite

Nomadic routing applications for wireless networking in a team of miniature robots

Cited by 4 publications

References 18 publications

Communication network challenges for collaborative vehicles

Communication network challenges for collaborative vehicles

A policy-based routing scheme for multi-robot systems

Collective robotics - a survey of control and communication techniques

Contact Info

Product

Resources

About