864 research outputs found
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
On the Positive Effect of Delay on the Rate of Convergence of a Class of Linear Time-Delayed Systems
This paper is a comprehensive study of a long observed phenomenon of increase
in the stability margin and so the rate of convergence of a class of linear
systems due to time delay. We use Lambert W function to determine (a) in what
systems the delay can lead to increase in the rate of convergence, (b) the
exact range of time delay for which the rate of convergence is greater than
that of the delay free system, and (c) an estimate on the value of the delay
that leads to the maximum rate of convergence. For the special case when the
system matrix eigenvalues are all negative real numbers, we expand our results
to show that the rate of convergence in the presence of delay depends only on
the eigenvalues with minimum and maximum real parts. Moreover, we determine the
exact value of the maximum rate of convergence and the corresponding maximizing
time delay. We demonstrate our results through a numerical example on the
practical application in accelerating an agreement algorithm for
networked~systems by use of a delayed feedback
On Robustness Analysis of a Dynamic Average Consensus Algorithm to Communication Delay
This paper studies the robustness of a dynamic average consensus algorithm to
communication delay over strongly connected and weight-balanced (SCWB)
digraphs. Under delay-free communication, the algorithm of interest achieves a
practical asymptotic tracking of the dynamic average of the time-varying
agents' reference signals. For this algorithm, in both its continuous-time and
discrete-time implementations, we characterize the admissible communication
delay range and study the effect of the delay on the rate of convergence and
the tracking error bound. Our study also includes establishing a relationship
between the admissible delay bound and the maximum degree of the SCWB digraphs.
We also show that for delays in the admissible bound, for static signals the
algorithms achieve perfect tracking. Moreover, when the interaction topology is
a connected undirected graph, we show that the discrete-time implementation is
guaranteed to tolerate at least one step delay. Simulations demonstrate our
results
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
Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
This paper proposes a novel class of distributed continuous-time coordination
algorithms to solve network optimization problems whose cost function is a sum
of local cost functions associated to the individual agents. We establish the
exponential convergence of the proposed algorithm under (i) strongly connected
and weight-balanced digraph topologies when the local costs are strongly convex
with globally Lipschitz gradients, and (ii) connected graph topologies when the
local costs are strongly convex with locally Lipschitz gradients. When the
local cost functions are convex and the global cost function is strictly
convex, we establish asymptotic convergence under connected graph topologies.
We also characterize the algorithm's correctness under time-varying interaction
topologies and study its privacy preservation properties. Motivated by
practical considerations, we analyze the algorithm implementation with
discrete-time communication. We provide an upper bound on the stepsize that
guarantees exponential convergence over connected graphs for implementations
with periodic communication. Building on this result, we design a
provably-correct centralized event-triggered communication scheme that is free
of Zeno behavior. Finally, we develop a distributed, asynchronous
event-triggered communication scheme that is also free of Zeno with asymptotic
convergence guarantees. Several simulations illustrate our results.Comment: 12 page
An automotive vehicle dynamics prototyping platform based on a remote control model car
The use of a modified remote control (RC) model car as a vehicle dynamics testing and development platform is detailed. Vehicle dynamics testing is an important aspect of automotive engineering and it plays a key role during the design and tuning of active safety control systems. Considering the fact that such tests are conducted at great expense, scaled model cars can potentially be used to help with the process to reduce the costs. With this view, we instrument and develop a standard electric RC model car into a vehicle dynamics testing platform. We then implement 2 representative active safety control applications based on this platform, namely an antilock brake system using open-loop pulse brake control and a roll-over prevention system utilizing lateral acceleration feedback. Both applications are presented with sensor measurements and the effectiveness of the suggested control algorithms are demonstrated. © TÜBİTAK
GPC based PID control of the roll Channel of flying vehicle with two actuators
A strategy to increase the control ability of aerodynamic control flying vehicles at the altitude higher than the standard range by using continuous time cold gas thruster is proposed in this paper. At the first an optimal PID (Proportional Integral Derivative) controller algorithm based on predictive control technique is defined, and a generalized predictive control (GPC) is used to derive the control law. Finally, based on the GPC control law PID control, parameters are calculated recursively. The result shows a proper response in the control of flying vehicle.Keywords: Optimal PID Generalized predictive control, Flight control
- …