26,649 research outputs found
Consensus-Based Attitude Maneuver of Multi-spacecraft with Exclusion Constraints
Some space missions involve cooperative multi-vehicle teams, for such purposes as interferometry and optimal sensor coverage, for example, NASA Terrestrial Planet Finder Mission. Cooperative navigation introduces extra constraints of exclusion zones between the spacecraft to protect them from damaging each other. This is in addition to external exclusion constraints introduced by damaging or blinding celestial objects. This work presents a quaternion-based attitude consensus protocol, using the communication topology of the team of spacecraft. The resulting distributed Laplacians of their communication graph are applied by semidefinite programming (SDP), to synthesize a series of time-varying optimal stochastic matrices. The matrices are used to generate various cooperative attitude maneuvers from the initial attitudes of the spacecraft. Exclusion constraints are satisfied by quaternion-based quadratically constrained attitude control (Q-CAC), where both static and dynamic exclusion zones are identified every time step, expressed as time-varying linear matrix inequalities (LMI) and solved by semidefinite programming
Graph-Based Distributed Control for Adaptive Multi-Robot Patrolling through Local Formation Transformation
Multi-robot cooperative navigation in real-world environments is essential in many applications, including surveillance and search-and-rescue missions. State-of-the-art methods for cooperative navigation are often tested in ideal laboratory conditions and not ready to be deployed in real- world environments, which are often cluttered with static and dynamic obstacles. In this work, we explore a graph-based framework to achieve control of real robot formations moving in a world cluttered with a variety of obstacles by introducing a new distributed algorithm for reconfiguring the formation shape. We systematically validate the reconfiguration algorithm using three real robots in scenarios of increasing complexity
Distributed Spatio-Temporal Information Based Cooperative 3D Positioning in GNSS-Denied Environments
A distributed spatio-temporal information based cooperative positioning
(STICP) algorithm is proposed for wireless networks that require
three-dimensional (3D) coordinates and operate in the global navigation
satellite system (GNSS) denied environments. Our algorithm supports any type of
ranging measurements that can determine the distance between nodes. We first
utilize a finite symmetric sampling based scaled unscented transform (SUT)
method for approximating the nonlinear terms of the messages passing on the
associated factor graph (FG) with high precision, despite relying on a small
number of samples. Then, we propose an enhanced anchor upgrading mechanism to
avoid any redundant iterations. Our simulation results and analysis show that
the proposed STICP has a lower computational complexity than the
state-of-the-art belief propagation based localizer, despite achieving an even
more competitive positioning performance
Decentralized formation control with connectivity maintenance and collision avoidance under limited and intermittent sensing
A decentralized switched controller is developed for dynamic agents to
perform global formation configuration convergence while maintaining network
connectivity and avoiding collision within agents and between stationary
obstacles, using only local feedback under limited and intermittent sensing.
Due to the intermittent sensing, constant position feedback may not be
available for agents all the time. Intermittent sensing can also lead to a
disconnected network or collisions between agents. Using a navigation function
framework, a decentralized switched controller is developed to navigate the
agents to the desired positions while ensuring network maintenance and
collision avoidance.Comment: 8 pages, 2 figures, submitted to ACC 201
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
Implicit Cooperative Positioning in Vehicular Networks
Absolute positioning of vehicles is based on Global Navigation Satellite
Systems (GNSS) combined with on-board sensors and high-resolution maps. In
Cooperative Intelligent Transportation Systems (C-ITS), the positioning
performance can be augmented by means of vehicular networks that enable
vehicles to share location-related information. This paper presents an Implicit
Cooperative Positioning (ICP) algorithm that exploits the Vehicle-to-Vehicle
(V2V) connectivity in an innovative manner, avoiding the use of explicit V2V
measurements such as ranging. In the ICP approach, vehicles jointly localize
non-cooperative physical features (such as people, traffic lights or inactive
cars) in the surrounding areas, and use them as common noisy reference points
to refine their location estimates. Information on sensed features are fused
through V2V links by a consensus procedure, nested within a message passing
algorithm, to enhance the vehicle localization accuracy. As positioning does
not rely on explicit ranging information between vehicles, the proposed ICP
method is amenable to implementation with off-the-shelf vehicular communication
hardware. The localization algorithm is validated in different traffic
scenarios, including a crossroad area with heterogeneous conditions in terms of
feature density and V2V connectivity, as well as a real urban area by using
Simulation of Urban MObility (SUMO) for traffic data generation. Performance
results show that the proposed ICP method can significantly improve the vehicle
location accuracy compared to the stand-alone GNSS, especially in harsh
environments, such as in urban canyons, where the GNSS signal is highly
degraded or denied.Comment: 15 pages, 10 figures, in review, 201
- …