oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 16 )

2018 ( 205 )

2017 ( 196 )

2016 ( 184 )

Custom range...

Search Results: 1 - 10 of 11329 matches for " Yongcan Cao "
All listed articles are free for downloading (OA Articles)
Page 1 /11329
Display every page Item
UAV Circumnavigating an Unknown Target Under a GPS-denied Environment with Range-only Measurements
Yongcan Cao
Mathematics , 2014,
Abstract: One typical application of unmanned aerial vehicles is the intelligence, surveillance, and reconnaissance mission, where the objective is to improve situation awareness through information acquisition. For examples, an efficient way to gather information regarding a target is to deploy UAV in such a way that it orbits around this target at a desired distance. Such a UAV motion is called circumnavigation. The objective of the paper is to design a UAV control algorithm such that this circumnavigation mission is achieved under a GPS-denied environment using range-only measurement. The control algorithm is constructed in two steps. The first step is to design a UAV control algorithm by assuming the availability of both range and range rate measurements, where the associated control input is always bounded. The second step is to further eliminate the use of range rate measurement by using an estimated range rate, obtained via a sliding-mode estimator using range measurement, to replace actual range rate measurement. Such a controller design technique is applicable in the control design of other UAV navigation and control missions under a GPS-denied environment.
Finite-time Consensus for Multi-agent Networks with Unknown Inherent Nonlinear Dynamics
Yongcan Cao,Wei Ren
Mathematics , 2013,
Abstract: This paper focuses on analyzing the finite-time convergence of a nonlinear consensus algorithm for multi-agent networks with unknown inherent nonlinear dynamics. Due to the existence of the unknown inherent nonlinear dynamics, the stability analysis and the finite-time convergence analysis of the closed-loop system under the proposed consensus algorithm are more challenging than those under the well-studied consensus algorithms for known linear systems. For this purpose, we propose a novel stability tool based on a generalized comparison lemma. With the aid of the novel stability tool, it is shown that the proposed nonlinear consensus algorithm can guarantee finite-time convergence if the directed switching interaction graph has a directed spanning tree at each time interval. Specifically, the finite-time convergence is shown by comparing the closed-loop system under the proposed consensus algorithm with some well-designed closed-loop system whose stability properties are easier to obtain. Moreover, the stability and the finite-time convergence of the closed-loop system using the proposed consensus algorithm under a (general) directed switching interaction graph can even be guaranteed by the stability and the finite-time convergence of some special well-designed nonlinear closed-loop system under some special directed switching interaction graph, where each agent has at most one neighbor whose state is either the maximum of those states that are smaller than its own state or the minimum of those states that are larger than its own state. This provides a stimulating example for the potential applications of the proposed novel stability tool in the stability analysis of linear/nonlinear closed-loop systems by making use of known results in linear/nonlinear systems. For illustration of the theoretical result, we provide a simulation example.
Decentralized Event-Triggered Consensus over Unreliable Communication Networks
Eloy Garcia,Yongcan Cao,David W. Casbeer
Mathematics , 2015,
Abstract: This article studies distributed event-triggered consensus over unreliable communication channels. Communication is unreliable in the sense that the broadcast channel from one agent to its neighbors can drop the event-triggered packets of information, where the transmitting agent is unaware that the packet was not received and the receiving agents have no knowledge of the transmitted packet. Additionally, packets that successfully arrive at their destination may suffer from time-varying communication delays. In this paper, we consider directed graphs, and we also relax the consistency on the packet dropouts and the delays. Relaxing consistency means that the delays and dropouts for a packet broadcast by one agent can be different for each receiving node. We show that even under this challenging scenario, agents can reach consensus asymptotically while reducing transmissions of measurements based on the proposed event-triggered consensus protocol. In addition, positive inter-event times are obtained which guarantee that Zeno behavior does not occur.
Periodic Event-Triggered Synchronization of Linear Multi-agent Systems with Communication Delays
Eloy Garcia,Yongcan Cao,David W. Casbeer
Mathematics , 2015,
Abstract: Multi-agent systems cooperation to achieve global goals is usually limited by sensing, actuation, and communication issues. At the local level, continuous measurement and actuation is only approximated by the use of digital mechanisms that measure and process information in order to compute and update new control input values at discrete time instants. Interaction with other agents or subsystems takes place, in general, through a digital communication channel with limited bandwidth where transmission of continuous-time signals is not possible. Additionally, communication channels may be subject to other imperfections such as time-varying delays. This paper considers the problem of consensus (or synchronization of state trajectories) of multi-agent systems that are described by general linear dynamics and are connected using undirected graphs. An event-triggered consensus protocol is proposed, where each agent implements discretized and decoupled models of the states of its neighbors. This approach not only avoids the need for continuous communication between agents but also provides a decentralized method for transmission of information in the presence of time-varying communication delays where each agent decides its own broadcasting time instants based only on local information. This method gives more flexibility for scheduling information broadcasting compared to periodic and sampled-data implementations. The use of discretized models by each agent allows for a periodic event-triggered strategy where continuous actuation and continuous measurement of the states are not necessary.
An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination
Yongcan Cao,Wenwu Yu,Wei Ren,Guanrong Chen
Mathematics , 2012,
Abstract: This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations.
UAV Circumnavigation of an Unknown Target Without Location Information Using Noisy Range-based Measurements
Araz Hashemi,Yongcan Cao,David Casbeer,George Yin
Mathematics , 2013,
Abstract: This paper proposes a control algorithm for a UAV to circumnavigate an unknown target at a fixed radius when the location information of the UAV is unavailable. By assuming that the UAV has a constant velocity, the control algorithm makes adjustments to the heading angle of the UAV based on range and range rate measurements from the target, which may be corrupted by additive measurement noise. The control algorithm has the added benefit of being globally smooth and bounded. Exploiting the relationship between range rate and bearing angle, we transform the system dynamics from Cartesian coordinate in terms of location and heading to polar coordinate in terms of range and bearing angle. We then formulate the addition of measurement errors as a stochastic differential equation. A recurrence result is established showing that the UAV will reach a neighborhood of the desired orbit in finite time. Some statistical measures of performance are obtained to support the technical analysis.
Decentralized Event-Triggered Consensus of Linear Multi-agent Systems under Directed Graphs
Eloy Garcia,Yongcan Cao,Xiaofeng Wang,David W. Casbeer
Mathematics , 2015,
Abstract: An event-triggered control technique for consensus of multi-agent systems with general linear dynamics is presented. This paper extends previous work to consider agents that are connected using directed graphs. Additionally, the approach shown here provides asymptotic consensus with guaranteed positive inter-event time intervals. This event-triggered control method is also used in the case where communication delays are present. For the communication delay case we also show that the agents achieve consensus asymptotically and that, for every agent, the time intervals between consecutive transmissions is lower-bounded by a positive constant.
Circumnavigation of an Unknown Target Using UAVs with Range and Range Rate Measurements
Yongcan Cao,Jonathan Muse,David Casbeer,Derek Kingston
Mathematics , 2013,
Abstract: This paper presents two control algorithms enabling a UAV to circumnavigate an unknown target using range and range rate (i.e., the derivative of range) measurements. Given a prescribed orbit radius, both control algorithms (i) tend to drive the UAV toward the tangent of prescribed orbit when the UAV is outside or on the orbit, and (ii) apply zero control input if the UAV is inside the desired orbit. The algorithms differ in that, the first algorithm is smooth and unsaturated while the second algorithm is non-smooth and saturated. By analyzing properties associated with the bearing angle of the UAV relative to the target and through proper design of Lyapunov functions, it is shown that both algorithms produce the desired orbit for an arbitrary initial state. Three examples are provided as a proof of concept.
Bridge Consensus: Ignoring Initial Inessentials
David W. Casbeer,Yongcan Cao,Eloy Garcia,Dejan Milutinovic
Computer Science , 2015,
Abstract: In this paper, the problem of bridge consensus is presented and solved. Bridge consensus consists of a network of nodes, some of whom are participating and others are non-participating. The objective is for all the agents to reach average consensus of the participating nodes initial values in a distributed and scalable manner. To do this, the nodes must use the network connections of the non-participating nodes, which act as bridges for information and ignore the initial values of the non-participating nodes. The solution to this problem is made by merging the ideas from estimation theory and consensus theory. By considering the participating nodes has having equal information and the non-participating nodes as having no information, the nodes initial values are transformed into information space. Two consensus filters are run in parallel on the information state and information matrix. Conditions ensuring that the product of the inverse information matrix and the information state of each agent reaches average consensus of the participating agents' initial values is given.
Distributed Adaptive Fault-Tolerant Control of Uncertain Multi-Agent Systems
Mohsen Khalili,Xiaodong Zhang,Marios M. Polycarpou,Thomas Parisini,Yongcan Cao
Computer Science , 2015,
Abstract: This paper presents an adaptive fault-tolerant control (FTC) scheme for a class of nonlinear uncertain multi-agent systems. A local FTC scheme is designed for each agent using local measurements and suitable information exchanged between neighboring agents. Each local FTC scheme consists of a fault diagnosis module and a reconfigurable controller module comprised of a baseline controller and two adaptive fault-tolerant controllers activated after fault detection and after fault isolation, respectively. Under certain assumptions, the closed-loop system's stability and leader-follower consensus properties are rigorously established under different modes of the FTC system, including the time-period before possible fault detection, between fault detection and possible isolation, and after fault isolation.
Page 1 /11329
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.