Reactive Control Of Autonomous Dynamical Systems

This thesis mainly consists of five independent papers concerning the reactive control design of autonomous mobile robots in the context of target tracking and cooperative formation keeping with obstacle avoidance in the static/dynamic environment. Technical contents of this thesis are divided into three parts. The first part consists of the first two papers, which consider the target-tracking and obstacle avoidance in the static environment. Especially, in the static environment, a fundamental issue of reactive control design is the local minima problem(LMP) inherent in the potential field methods(PFMs). Through introducing a state-dependent planned goal, the first paper proposes a switching control strategy to tackle this problem. The control law for the planned goal is presented. When trapped into local minima, the robot can escape from local minima by following the planned goal. The proposed control law also takes into account the presence of possible saturation constraints. In addition, a time-varying continuous control law is proposed in the second paper to tackle this problem. Challenges of finding continuous control solutions of LMP are discussed and explicit design strategies are then proposed. The second part of this thesis deals with target-tracking and obstacle avoidance in the dynamic environment. In the third paper, a reactive control design is presented for omnidirectional mobile robots with limited sensor range to track targets while avoiding static and moving obstacles in a dynamically evolving environment. Towards this end, a multiiii objective control problem is formulated and control is synthesized by generating a potential field force for each objective and combining them through analysis and design. Different from standard potential field methods, the composite potential field described in this paper is time-varying and planned to account for moving obstacles and vehicle motion. In order to accommodate a larger class of mobile robots, the fourth paper proposes a reactive control design for unicycle-type mobile robots. With the relative motion among the mobile robot, targets, and obstacles being formulated in polar coordinates, kinematic control laws achieving target-tracking and obstacle avoidance are synthesized using Lyapunov based technique, and more importantly, the proposed control laws also take into account possible kinematic control saturation constraints. The third part of this thesis investigates the cooperative formation control with collision avoidance. In the fifth paper, firstly, the target tracking and collision avoidance problem for a single agent is studied. Instead of directly extending the single agent controls to the multiagents case, the single agent controls are incorporated with the cooperative control design presented in [1]. The proposed decentralized control is reactive, considers the formation feedback and changes in the communication networks. The proposed control is based on a potential field method, its inherent oscillation problem is also studied to improve group transient performance

A decentralized motion coordination strategy for dynamic target tracking

This paper presents a decentralized motion planning algorithm for the distributed sensing of a noisy dynamical process by multiple cooperating mobile sensor agents. This problem is motivated by localization and tracking tasks of dynamic targets. Our gradient-descent method is based on a cost function that measures the overall quality of sensing. We also investigate the role of imperfect communication between sensor agents in this framework, and examine the trade-offs in performance between sensing and communication. Simulations illustrate the basic characteristics of the algorithms

Renyi Entropy based Target Tracking in Mobile Sensor Networks

This paper proposes an entropy based target tracking approach for mobile sensor networks. The proposed tracking algorithm runs a target state estimation stage and a motion control stage alternatively. A distributed particle filter is developed to estimate the target position in the first stage. This distributed particle filter does not require to transmit the weighted particles from one sensor node to another. Instead, a Gaussian mixture model is formulated to approximate the posterior distribution represented by the weighted particles via an EM algorithm. The EM algorithm is developed in a distributed form to compute the parameters of Gaussian mixture model via local communication, which leads to the distributed implementation of the particle filter. A flocking controller is developed to control the mobile sensor nodes to track the target in the second stage. The flocking control algorithm includes three components. Collision avoidance component is based on the design of a separation potential function. Alignment component is based on a consensus algorithm. Navigation component is based on the minimization of an quadratic Renyi entropy. The quadratic Renyi entropy of Gaussian mixture model has an analytical expression so that its optimization is feasible in mobile sensor networks. The proposed active tracking algorithm is tested in simulation. © 2011 IFAC

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing