7 research outputs found

    On the genericity properties in networked estimation: Topology design and sensor placement

    Full text link
    In this paper, we consider networked estimation of linear, discrete-time dynamical systems monitored by a network of agents. In order to minimize the power requirement at the (possibly, battery-operated) agents, we require that the agents can exchange information with their neighbors only \emph{once per dynamical system time-step}; in contrast to consensus-based estimation where the agents exchange information until they reach a consensus. It can be verified that with this restriction on information exchange, measurement fusion alone results in an unbounded estimation error at every such agent that does not have an observable set of measurements in its neighborhood. To over come this challenge, state-estimate fusion has been proposed to recover the system observability. However, we show that adding state-estimate fusion may not recover observability when the system matrix is structured-rank (SS-rank) deficient. In this context, we characterize the state-estimate fusion and measurement fusion under both full SS-rank and SS-rank deficient system matrices.Comment: submitted for IEEE journal publicatio

    Fast-Convergent Dynamics for Distributed Resource Allocation Over Sparse Time-Varying Networks

    Full text link
    In this paper, distributed dynamics are deployed to solve resource allocation over time-varying multi-agent networks. The state of each agent represents the amount of resources used/produced at that agent while the total amount of resources is fixed. The idea is to optimally allocate the resources among the group of agents by reducing the total cost functions subject to fixed amount of total resources. The information of each agent is restricted to its own state and cost function and those of its immediate neighbors. This is motivated by distributed applications such as in mobile edge-computing, economic dispatch over smart grids, and multi-agent coverage control. The non-Lipschitz dynamics proposed in this work shows fast convergence as compared to the linear and some nonlinear solutions in the literature. Further, the multi-agent network connectivity is more relaxed in this paper. To be more specific, the proposed dynamics even reaches optimal solution over time-varying disconnected undirected networks as far as the union of these networks over some bounded non-overlapping time-intervals includes a spanning-tree. The proposed convergence analysis can be applied for similar 1st-order resource allocation nonlinear dynamics. We provide simulations to verify our results

    Market-Based Approach to Mobile Surveillance Systems

    Get PDF
    The active surveillance of public and private sites is increasingly becoming a very important and critical issue. It is, therefore, imperative to develop mobile surveillance systems to protect these sites. Modern surveillance systems encompass spatially distributed mobile and static sensors in order to provide effective monitoring of persistent and transient objects and events in a given area of interest (AOI). The realization of the potential of mobile surveillance requires the solution of different challenging problems such as task allocation, mobile sensor deployment, multisensor management, cooperative object detection and tracking, decentralized data fusion, and interoperability and accessibility of system nodes. This paper proposes a market-based approach that can be used to handle different problems of mobile surveillance systems. Task allocation and cooperative target tracking are studied using the proposed approach as two challenging problems of mobile surveillance systems. These challenges are addressed individually and collectively

    An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

    Get PDF
    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

    A Decomposition Strategy for Optimal Coverage of an Area of Interest using Heterogeneous Team of UAVs

    Get PDF
    In this thesis, we study the problem of optimal search and coverage with heterogeneous team of unmanned aerial vehicles (UAVs). The team must complete the coverage of a given region while minimizing the required time and fuel for performing the mission. Since the UAVs have different characteristics one needs to equalize the ratio of the task to the capabilities of each agent to obtain an optimal solution. A multi-objective task assignment framework is developed for finding the best group of agents that by assigning the optimal tasks would carry out the mission with minimum total cost. Once the optimal tasks for UAVs are obtained, the coverage area (map) is partitioned according to the results of the multi-objective task assignment. The strategy is to partition the coverage area into separate regions so that each agent is responsible for performing the surveillance of its particular region. The decentralized power diagram algorithm is used to partition the map according to the results of the task assignment phase. Furthermore, a framework for solving the task assignment problem and the coverage area partitioning problem in parallel is proposed. A criterion for achieving the minimum number of turns in covering a region a with single UAV is studied for choosing the proper path direction for each UAV. This criterion is extended to develop a method for partitioning the coverage area among multiple UAVs that minimizes the number of turns. We determine the "best" team for performing the coverage mission and we find the optimal workload for each agent that is involved in the mission through a multi-objective optimization procedure. The search area is then partitioned into disjoint subregions, and each agent is assigned to a region having an optimum area resulting in the minimum cost for the entire surveillance mission
    corecore