4,567 research outputs found
Development of personal area network (PAN) for mobile robot using bluetooth transceiver
The work presents the concept of providing a Personal Area Network (PAN) for microcontroller based mobile robots using Bluetooth transceiver. With the concept of replacing cable, low cost, low power consumption and communication range between 10m to 100m, Bluetooth is suitable for communication between mobile robots since most mobile robots are powered by batteries and have high mobility. The network aimed to support real-time control of up to two mobile robots from a master mobile robot through communication using Bluetooth transceiver. If a fast network radio link is implemented, a whole new world of possibilities is opened in the research of robotics control and Artificial Intelligence (AI) research works, sending real time image and information. Robots could communicate through obstacles or even through walls. Bluetooth Ad Hoc topology provides a simple communication between devices in close by forming PAN. A system contained of both hardware and software is designed to enable the robots to form a PAN and communicating, sharing information. Three microcontroller based mobile robots are built for this research work. Bluetooth Protocol Stack and mobile robot control architecture is implemented on a single microcontroller chip. The PAN enabled a few mobile robots to communicate with each other to complete a given task. The wireless communication between mobile robots is reliable based from the result of experiments carried out. Thus this is a platform for multi mobile robots system and Ad Hoc networking system. Results from experiments show that microcontroller based mobile robots can easily form a Bluetooth PAN and communicate with each other
Robot Swarms in an Uncertain World: Controllable Adaptability
There is a belief that complexity and chaos are essential for adaptability.
But life deals with complexity every moment, without the chaos that engineers
fear so, by invoking goal-directed behaviour. Goals can be programmed. That is
why living organisms give us hope to achieve adaptability in robots. In this
paper a method for the description of a goal-directed, or programmed,
behaviour, interacting with uncertainty of environment, is described. We
suggest reducing the structural (goals, intentions) and stochastic components
(probability to realise the goal) of individual behaviour to random variables
with nominal values to apply probabilistic approach. This allowed us to use a
Normalized Entropy Index to detect the system state by estimating the
contribution of each agent to the group behaviour. The number of possible group
states is 27. We argue that adaptation has a limited number of possible paths
between these 27 states. Paths and states can be programmed so that after
adjustment to any particular case of task and conditions, adaptability will
never involve chaos. We suggest the application of the model to operation of
robots or other devices in remote and/or dangerous places.Comment: Journal web page & a lot of robotic related papers
www.ars-journal.co
Towards Swarm Calculus: Urn Models of Collective Decisions and Universal Properties of Swarm Performance
Methods of general applicability are searched for in swarm intelligence with
the aim of gaining new insights about natural swarms and to develop design
methodologies for artificial swarms. An ideal solution could be a `swarm
calculus' that allows to calculate key features of swarms such as expected
swarm performance and robustness based on only a few parameters. To work
towards this ideal, one needs to find methods and models with high degrees of
generality. In this paper, we report two models that might be examples of
exceptional generality. First, an abstract model is presented that describes
swarm performance depending on swarm density based on the dichotomy between
cooperation and interference. Typical swarm experiments are given as examples
to show how the model fits to several different results. Second, we give an
abstract model of collective decision making that is inspired by urn models.
The effects of positive feedback probability, that is increasing over time in a
decision making system, are understood by the help of a parameter that controls
the feedback based on the swarm's current consensus. Several applicable
methods, such as the description as Markov process, calculation of splitting
probabilities, mean first passage times, and measurements of positive feedback,
are discussed and applications to artificial and natural swarms are reported
Cellular Automata Applications in Shortest Path Problem
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 201
- …