5,695 research outputs found
Realization of reactive control for multi purpose mobile agents
Mobile robots are built for different purposes, have different physical size, shape, mechanics and electronics. They are required to work in real-time, realize more than one goal simultaneously, hence to communicate and cooperate with other agents. The approach proposed in this paper for mobile robot control is reactive and has layered structure that supports multi sensor perception. Potential field method is implemented for both obstacle avoidance and goal tracking. However imaginary forces of the obstacles and of the goal point are separately treated, and then resulting behaviors are fused with the help of the geometry. Proposed control is tested on simulations where
different scenarios are studied. Results have confirmed the high performance of the method
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
Towards a Shared Control Navigation Function:Efficiency Based Command Modulation
This paper presents a novel shared control algorithm for robotized
wheelchairs. The proposed algorithm is a new method to extend
autonomous navigation techniques into the shared control domain. It reactively
combines user’s and robot’s commands into a continuous function
that approximates a classic Navigation Function (NF) by weighting input
commands with NF constraints. Our approach overcomes the main drawbacks
of NFs -calculus complexity and limitations on environment
modeling- so it can be used in dynamic unstructured environments. It also
benefits from NF properties: convergence to destination, smooth paths
and safe navigation. Due to the user’s contribution to control, our function
is not strictly a NF, so we call it a pseudo-navigation function (PNF)
instead.Universidad de Málaga. Campus de Excelencia Internacional AndalucÃa Tech
- …