TOKEN-BASED APPROACH FOR SCALABLE TEAMCOORDINATION

To form a cooperative multiagent team, autonomous agents are required to harmonize activities and make the best use of exclusive resources to achieve their common goal. In addition, to handle uncertainty and quickly respond to external environmental events, they should share knowledge and sensor in formation. Unlike small team coordination, agents in scalable team must limit the amount of their communications while maximizing team performance. Communication decisions are critical to scalable-team coordination because agents should target their communications, but these decisions cannot be supported by a precise model or by complete team knowledge.The hypothesis of my thesis is: local routing of tokens encapsulating discrete elements of control, based only on decentralized local probability decision models, will lead to efficient scalable coordination with several hundreds of agents. In my research, coordination controls including all domain knowledge, tasks and exclusive resources are encapsulated into tokens. By passing tokens around, agents transfer team controls encapsulated in the tokens. The team benefits when a token is passed to an agent who can make use of it, but communications incur costs. Hence, no single agent has sole responsible over any shared decision. The key problem lies in how agents make the correct decisions to target communications and pass tokens so that they will potentially benefit the team most when considering communication costs.My research on token-based coordination algorithm starts from the investigation of random walk of token movement. I found a little increase of the probabilities that agents make the right decision to pass a token, the overall efficiency of the token movement could be greatly enhanced. Moreover, if token movements are modeled as a Markov chain, I found that the efficiency of passing tokens could be significantly varied based on different network topologies.My token-based algorithm starts at the investigation of each single decision theoretic agents. Although under the uncertainties that exist in large multiagent teams, agents cannot act optimal, it is still feasible to build a probability model for each agents to rationally pass tokens. Specifically, this decision only allow agent to pass tokens over an associate network where only a few of team members are considered as token receiver.My proposed algorithm will build each agent's individual decision model based on all of its previously received tokens. This model will not require the complete knowledge of the team. The key idea is that I will make use of the domain relationships between pairs of coordination controls. Previously received tokens will help the receiver to infer whether the sender could benefit the team if a related token is received. Therefore, each token is used to improve the routing of other tokens, leading to a dramatic performance improvement when more tokens are added. By exploring the relationships between different types of coordination controls, an integrated coordination algorithm will be built, and an improvement of one aspect of coordination will enhance the performance of the others

Hierarchical wireless framework for real-time collaborative generation and distribution of telemetry data

This project introduces a novel multidisciplinary approach combining Vehicular Ad Hoc Networks and Granular Computing, to the data processing and information generation problem in large urban traffic systems. It addresses the challenge of realtime information generation and dissemination in such systems by designing and investigating a hierarchical real-time information framework. The research work is complemented by designing and developing a simulator for such a system, which provides a simulation environment for the model developed. The proposed multidisciplinary hierarchical real-time information processing and dissemination system framework utilises results from two different areas of study, which are Vehicular Ad Hoc Networks (VANETS) and Granular Computing concepts. Furthermore, a new geographically constrained VANET topology for information generation is proposed, simulated and investigated

Uncertainty Management of Intelligent Feature Selection in Wireless Sensor Networks

Wireless sensor networks (WSN) are envisioned to revolutionize the paradigm of monitoring complex real-world systems at a very high resolution. However, the deployment of a large number of unattended sensor nodes in hostile environments, frequent changes of environment dynamics, and severe resource constraints pose uncertainties and limit the potential use of WSN in complex real-world applications. Although uncertainty management in Artificial Intelligence (AI) is well developed and well investigated, its implications in wireless sensor environments are inadequately addressed. This dissertation addresses uncertainty management issues of spatio-temporal patterns generated from sensor data. It provides a framework for characterizing spatio-temporal pattern in WSN. Using rough set theory and temporal reasoning a novel formalism has been developed to characterize and quantify the uncertainties in predicting spatio-temporal patterns from sensor data. This research also uncovers the trade-off among the uncertainty measures, which can be used to develop a multi-objective optimization model for real-time decision making in sensor data aggregation and samplin

Modeling driving experience in smart traffic routing scenarios: application to traffic multi-map routing

The effectiveness of user-oriented traffic routing applications to mitigate traffic congestion in Intelligent Transportation Systems depends on their degree of adoption, which usually evolves depending on subjective and exogenous factors. This paper proposes a user experience and social dynamics model to analyze and evaluate traffic routing methods, based on fuzzy rules and discrete choice theory. The model has been applied to the optimal Traffic-Weighted Multi-Maps (TWM) routing method to evaluate the adoption dynamics and analyze convergence towards the system optimum. Route unfairness and resistance to change are also considered in the model. Experimental results are obtained simulating the evolution of the drivers' population behavior. Simulation is carried over synthetic and real networks, using optimized TWM maps. The experimental results show how the TWM system evolves to a stationary System Optimum, improving overall traffic congestion and showing how User Equilibrium variability is bounded as it depends on user routing choices influenced by behavioral patterns

Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods

Copyright @ 2010 Elsevier B.V. All rights reserved.In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Optimizing Urban Distribution Routes for Perishable Foods Considering Carbon Emission Reduction

The increasing demand for urban distribution increases the number of transportation vehicles which intensifies the congestion of urban traffic and leads to a lot of carbon emissions. This paper focuses on carbon emission reduction in urban distribution, taking perishable foods as the object. It carries out optimization analysis of urban distribution routes to explore the impact of low carbon policy on urban distribution routes planning. On the base of analysis of the cost components and corresponding constraints of urban distribution, two optimization models of urban distribution route with and without carbon emissions cost are constructed, and fuel quantity related to cost and carbon emissions in the model is calculated based on traffic speed, vehicle fuel quantity and passable time period of distribution. Then an improved algorithm which combines genetic algorithm and tabu search algorithm is designed to solve models. Moreover, an analysis of the influence of carbon tax price is also carried out. It is concluded that in the process of urban distribution based on the actual network information, the path optimization considering the low carbon factor can effectively reduce the distribution process of CO2, and reduce the total cost of the enterprise and society, thus achieving greater social benefits at a lower cost. In addition, the government can encourage low-carbon distribution by rationally adjusting the price of carbon tax to achieve a higher social benefit