10,258 research outputs found
A flexible and dynamic mobile robot localization approach
[EN] The main goal of this paper is to provide an approach to solve the problem of localization in mobile robots using multi-agent systems. Usually, the robot localization problem is solved in static environments by the addition of the needed sensors in order to help the robot, but this is not useful in dynamic environments where the robot is moving through different rooms or areas. The novelty of this dynamic scenario is that each room is composed of external devices that can enter or exit the system in a dynamic way and report the position where the robot is. In this way, we propose a multi-agent system using the SPADE multi-agent technology platform to improve the location of mobile robots in dynamic scenarios. To do this, we are going to use some of the advantages offered by the SPADE platform such as presence notification and subscription protocols in order to design a friendship network between sensors/devices and the mobile robots.This work was supported by the project TIN2015-65515-C4-1-R of the Spanish government.Peñaranda-Cebrián, C.; Palanca Cámara, J.; Julian Inglada, VJ.; Botti, V. (2018). A flexible and dynamic mobile robot localization approach. Logic Journal of IGPL. https://doi.org/10.1093/jigpal/jzy045
Cooperative Localization under Limited Connectivity
We report two decentralized multi-agent cooperative localization algorithms
in which, to reduce the communication cost, inter-agent state estimate
correlations are not maintained but accounted for implicitly. In our first
algorithm, to guarantee filter consistency, we account for unknown inter-agent
correlations via an upper bound on the joint covariance matrix of the agents.
In the second method, we use an optimization framework to estimate the unknown
inter-agent cross-covariance matrix. In our algorithms, each agent localizes
itself in a global coordinate frame using a local filter driven by local dead
reckoning and occasional absolute measurement updates, and opportunistically
corrects its pose estimate whenever it can obtain relative measurements with
respect to other mobile agents. To process any relative measurement, only the
agent taken the measurement and the agent the measurement is taken from need to
communicate with each other. Consequently, our algorithms are decentralized
algorithms that do not impose restrictive network-wide connectivity condition.
Moreover, we make no assumptions about the type of agents or relative
measurements. We demonstrate our algorithms in simulation and a
robotic~experiment.Comment: 9 pages, 5 figure
Cooperative localization for mobile agents: a recursive decentralized algorithm based on Kalman filter decoupling
We consider cooperative localization technique for mobile agents with
communication and computation capabilities. We start by provide and overview of
different decentralization strategies in the literature, with special focus on
how these algorithms maintain an account of intrinsic correlations between
state estimate of team members. Then, we present a novel decentralized
cooperative localization algorithm that is a decentralized implementation of a
centralized Extended Kalman Filter for cooperative localization. In this
algorithm, instead of propagating cross-covariance terms, each agent propagates
new intermediate local variables that can be used in an update stage to create
the required propagated cross-covariance terms. Whenever there is a relative
measurement in the network, the algorithm declares the agent making this
measurement as the interim master. By acquiring information from the interim
landmark, the agent the relative measurement is taken from, the interim master
can calculate and broadcast a set of intermediate variables which each robot
can then use to update its estimates to match that of a centralized Extended
Kalman Filter for cooperative localization. Once an update is done, no further
communication is needed until the next relative measurement
Artificial Intelligence and Systems Theory: Applied to Cooperative Robots
This paper describes an approach to the design of a population of cooperative
robots based on concepts borrowed from Systems Theory and Artificial
Intelligence. The research has been developed under the SocRob project, carried
out by the Intelligent Systems Laboratory at the Institute for Systems and
Robotics - Instituto Superior Tecnico (ISR/IST) in Lisbon. The acronym of the
project stands both for "Society of Robots" and "Soccer Robots", the case study
where we are testing our population of robots. Designing soccer robots is a
very challenging problem, where the robots must act not only to shoot a ball
towards the goal, but also to detect and avoid static (walls, stopped robots)
and dynamic (moving robots) obstacles. Furthermore, they must cooperate to
defeat an opposing team. Our past and current research in soccer robotics
includes cooperative sensor fusion for world modeling, object recognition and
tracking, robot navigation, multi-robot distributed task planning and
coordination, including cooperative reinforcement learning in cooperative and
adversarial environments, and behavior-based architectures for real time task
execution of cooperating robot teams
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
- …