A fault-tolerant approach to robot teams

As the applications of mobile robotics evolve it has become increasingly less practical for researchers to design custom hardware and control systems for each problem. This paper presents a new approach to control system design in order to look beyond end-of-lifecycle performance, and consider control system structure, flexibility, and extensibility. Towards these ends the Control ad libitum philosophy was proposed, stating that to make significant progress in the real-world application of mobile robot teams the control system must be structured such that teams can be formed in real-time from diverse components. The Control ad libitum philosophy was applied to the design of the HAA (Host, Avatar, Agent) architecture: a modular hierarchical framework built with provably correct distributed algorithms. A control system for mapping, exploration, and foraging was developed using the HAA architecture and evaluated in three experiments. First, the basic functionality of the HAA architecture was studied, specifically the ability to: (a) dynamically form the control system, (b) dynamically form the robot team, (c) dynamically form the processing network, and (d) handle heterogeneous teams and allocate robots between tasks based on their capabilities. Secondly, the control system was tested with different rates of software failure and was able to successfully complete its tasks even when each module was set to fail every 0.5–1.5 min. Thirdly, the control system was subjected to concurrent software and hardware failures, and was still able to complete a foraging task in a 216 m² environment.     

Using relaxations to improve search in distributed constraint optimisation

Densely connected distributed constraint optimisation problems (DisCOP) can be difficult to solve optimally, but finding good lower bounds on constraint costs can help to speed up search. We show how good lower bounds can be found by solving relaxed problems obtained by removing inter-agent constraints. We present modifications to the Adopt DisCOP algorithm that allow an arbitrary number of relaxations to be performed prior to solving the original problem. We identify useful relaxations based on the solving structure used by Adopt, and demonstrate that when these relaxations are incorporated as part of the search it can lead to significant performance improvements. In particular, where agents have significant local constraint costs, we achieve over an order of magnitude reduction in messages exchanged between agents. Finally, we identify cases where such relaxation techniques produce less consistent benefits.     

A multi-agent architecture with cooperative fuzzy control for a mobile robot

The challenges of robotics have led the researchers to develop control architectures composed of distributed, independent and asynchronous behaviors. One way to approach decentralization is through cooperative control, since it allows the development of complex behavior based on several controllers combined to achieve the desired result. Robots, however, require high-level cognitive capacities, and multi-agent architectures provide the appropriate level of abstraction to define them. This article describes a multi-agent architecture combined with cooperative control developed within the agent. The experiments were carried out on an ActivMedia Pioneer 2DX mobile robot.     

Agent-based distributed manufacturing control: A state-of-the-art survey

Manufacturing has faced significant changes during the last years, namely the move from a local economy towards a global and competitive economy, with markets demanding for highly customized products of high quality at lower costs, and with short life cycles. In this environment, manufacturing enterprises, to remain competitive, must respond closely to customer demands by improving their flexibility and agility, while maintaining their productivity and quality. Dynamic response to emergence is becoming a key issue in manufacturing field because traditional manufacturing control systems are built upon rigid control architectures, which cannot respond efficiently and effectively to dynamic change. In these circumstances, the current challenge is to develop manufacturing control systems that exhibit intelligence, robustness and adaptation to the environment changes and disturbances. The introduction of multi-agent systems and holonic manufacturing systems paradigms addresses these requirements, bringing the advantages of modularity, decentralization, autonomy, scalability and re-usability. This paper surveys the literature in manufacturing control systems using distributed artificial intelligence techniques, namely multi-agent systems and holonic manufacturing systems principles. The paper also discusses the reasons for the weak adoption of these approaches by industry and points out the challenges and research opportunities for the future.     

Network-aware support for mobile distributed teams

An experiment evaluated network-aware support to increase understanding of the factors that are important for successful teamwork in mobile geographically dispersed teams of first responders. Participants performed a simulated search and rescue team task and were equipped with a digitized map and real-time situation updates on the location of other participants in a simulated disaster area. The connection to a server, however, was made deliberately error-prone, leading to occasional losses of network connections. Consequently, participants were not provided with real-time situation updates. To deal with this problem we equipped team members with a network-aware application that signaled network loss to them and adapted the graphical representation of the location of fellow team members accordingly to the quality of location information present. The experiment revealed that presenting complete and reliable geospatial information improves teamwork. Teams connected to a server over a fast and reliable link showed superior performance over teams with no network connection whatsoever to a server. The present study failed, however, to demonstrate the added value of network-aware support when teams had to collaborate in the presence of an unreliable communications infrastructure. Although participants indicated a slight preference for the network-aware application over a condition without support signaling network loss, no differences were observed in team process and outcome measures.     

Modeling gossip-based content dissemination and search in distributed networking

This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and distributed networks. When using random gossiping, communication with multiple peers in one gossiping round is allowed. The algorithms studied in this paper are considered under different network conditions, depending on the knowledge of the state of the neighboring nodes in the network. Different node behaviors, with respect to their degree of cooperation and compliance with the gossiping process, are also incorporated. From the exact analysis, several important performance metrics and design parameters are analytically determined. Based on the proposed metrics and parameters, the performance of the gossip-based dissemination or search schemes, as well as the impact of the design parameters, are evaluated.     

工业机器人的分布式控制系统设计

介绍了通用型工业机器人分布式控制系统的设计方案，总结了工业机器人控制系统设计所必须考虑的问题。分析说明：工业机器人分布式控制系统是一种比较理想的快速实时控制系统。     

Evolutionary control of bipedal locomotion in a high degree-of-freedom humanoid robot: first steps

This article describes a methodology, together with an associated series of experiments employing this methodology, for the evolution of walking behavior in a simulated humanoid robot with up to 20 degrees of freedom. The robots evolved in this study learn to walk smoothly in an upright or near-upright position and demonstrate a variety of different locomotive behaviors, including “skating,” “limping,” and walking in a manner curiously reminiscent of a mildly or heavily intoxicated person. A previous study demonstrated the possible potential utility of this approach while evolving controllers based on simulated humanoid robots with a restricted range of movements. Although walking behaviors were developed, these were slow and relied on the robot walking in an excessively stooped position, similar to the gait of an infirm elderly person. This article extends the previous work to a robot with many degrees of freedom, up to 20 in total (arms, elbows, legs, hips, knees, etc.), and demonstrates the automatic evolution of fully upright bipedal locomotion in a humanoid robot using an accurate physics simulator. This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006     

Data access in distributed simulations of multi-agent systems

Distributed simulation has emerged as an important instrument for studying large-scale complex systems. Such systems inherently consist of a large number of components, which operate in a large shared state space interacting with it in highly dynamic and unpredictable ways. Optimising access to the shared state space is crucial for achieving efficient simulation executions. Data accesses may take two forms: locating data according to a set of attribute value ranges (range query) or locating a particular state variable from the given identifier (ID query and update). This paper proposes two alternative routing approaches, namely the address-based approach, which locates data according to their address information, and the range-based approach, whose operation is based on looking up attribute value range information along the paths to the destinations. The two algorithms are discussed and analysed in the context of PDES-MAS, a framework for the distributed simulation of multi-agent systems, which uses a hierarchical infrastructure to manage the shared state space. The paper introduces a generic meta-simulation framework which is used to perform a quantitative comparative analysis of the proposed algorithms under various circumstances.     

From insect to Internet: Situated control for networked robot teams

Ant-like systems take advantage of agents' situatedness to reduce or eliminate the need for centralized control or global knowledge. This reduces the need for complexity of individuals and leads to robust, scalable systems. Such insect-inspired situated approaches have proven effective both for task performance and task allocation. The desire for general, principled techniques for situated interaction has led us to study the exploitation of abstract situatedness – situatedness in non-physical environments. The port-arbitrated behavior-based control approach provides a well-structured abstract behavior space in which agents can participate in situated interaction. We focus on the problem of role assumption, distributed task allocation in which each agent selects its own task-performing role. This paper details our general, principled Broadcast of Local Eligibility (BLE) technique for role-assumption in such behavior-space-situated systems, and provides experimental results from the CMOMMT target-tracking task. This revised version was published online in August 2006 with corrections to the Cover Date.     

Coordination of communication in robot teams by reinforcement learning

In multi-agent systems, the study of language and communication is an active field of research. In this paper we present the application of Reinforcement Learning (RL) to the self-emergence of a common lexicon in robot teams. By modeling the vocabulary or lexicon of each agent as an association matrix or look-up table that maps the meanings (i.e. the objects encountered by the robots or the states of the environment itself) into symbols or signals we check whether it is possible for the robot team to converge in an autonomous, decentralized way to a common lexicon by means of RL, so that the communication efficiency of the entire robot team is optimal. We have conducted several experiments aimed at testing whether it is possible to converge with RL to an optimal Saussurean Communication System. We have organized our experiments alongside two main lines: first, we have investigated the effect of the team size centered on teams of moderated size in the order of 5 and 10 individuals, typical of multi-robot systems. Second, and foremost, we have also investigated the effect of the lexicon size on the convergence results. To analyze the convergence of the robot team we have defined the team’s consensus when all the robots (i.e. 100% of the population) share the same association matrix or lexicon. As a general conclusion we have shown that RL allows the convergence to lexicon consensus in a population of autonomous agents.     

Implementing distributed control system for intelligent mobile robot

The control system of a mobile robot has a number of issues to deal with in real time, including motion control, mapping, localization, path planning, and sensor processing. Intelligent reasoning, task-oriented behaviors, human–robot interfaces, and communications add more tasks to be solved. This naturally leads to a complex hierarchical control system where various tasks have to be processed concurrently. Many low-level tasks can be handled by a robots onboard (host) computer. However, other tasks, such as speech recognition or vision processing, are too computationally intensive for one computer to process. In this case, it is better to consider a distributed design for the control system in networked environments. In order to achieve maximum use of the distributed environment, it is important to design and implement the distributed system and its communication mechanisms in an effective and flexible way. This article describes our approach to designing and implementing a distributed control system for an intelligent mobile robot. We present our implementation of such a distributed control system for a prototype mobile robot. We focus our discussion on the system architecture, distributed communication mechanisms, and distributed robot control.This work was presented, in part, at the 8th International Symposium on Artificial Life and Robotics, Oita, Japan, January 24–26, 2003     

Specifying distributed multi-agent systems in chemical reaction metaphor

This paper presents an application of Chemical Reaction Metaphor (CRM) in distributed multi-agent systems (MAS). The suitability of using CRM to model multi-agent systems is justified by CRM's capacity in specifying dynamic features of multi-agent systems. A case study in an agent-based e-learning system (course material updating) demonstrates how the CRM based language, Gamma, can be used to specify the architectures of multi-agent systems. The effectiveness of specifying multi-agent systems in CRM from the view point of software engineering is further justified by introducing a transformational method for implementing the specified multi-agent systems. A computation model with a tree-structured architecture is proposed to base the design of the specified multi-agent system during the implementation phase. A module language based on the computation model is introduced as an intermediate language to facilitate the translation of the specification of multi-agent systems. The multicast networking technology pragmatizes the implementation of communications and synchronization among distributed agents. The paper also discusses the feasibility of implementing an automatic translation from the Gamma specification to a program in the module language. This work is supported by University of Houston-Downtown Organized Research Committee.     

A bounded distributed connectivity preserving aggregation strategy with collision avoidance property

This paper presents a bounded connectivity preserving control strategy for the aggregation of multi-agent systems. The problem is investigated for two cases of single-integrator agents and unicycles. Under the proposed control strategy, if two agents are in the connectivity range at some point in time, they will stay connected thereafter. The agents finally aggregate while avoiding collision in such a way that the average of the distances between every pair of neighboring agents is bounded by a pre-specified positive real number, which can be chosen arbitrarily small. The results are developed based on some important characteristics of the positive limit set of the closed-loop system under the proposed control strategy and a fundamental property of convex real functions. The theoretical results are verified by simulation.     

铅钙合金浇铸浮渣铲除工业机器人控制系统的设计与研究

主要根据浮渣铲除机器人在冶炼厂中自动铲除浮渣的作业要求,以单片机控制技术、传感器技术及电机驱动技术为核心,成功研制出了浮渣铲除机器人的单片机测控系统。论文首先介绍了机器人系统的组成,然后介绍了机器人控制系统的总体方案。     

Cooperation without deliberation: A minimal behavior-based approach to multi-robot teams

While terminology and some concepts of behavior-based robotics have become widespread, the central ideas are often lost as researchers try to scale behavior to higher levels of complexity. “Hybrid systems” with model-based strategies that plan in terms of behaviors rather than simple actions have become common for higher-level behavior. We claim that a strict behavior-based approach can scale to higher levels of complexity than many robotics researchers assume, and that the resulting systems are in many cases more efficient and robust than those that rely on “classical AI” deliberative approaches. Our focus is on systems of cooperative autonomous robots in dynamic environments. We will discuss both claims that deliberation and explicit communication are necessary to cooperation and systems that cooperate only through environmental interaction. In this context we introduce three design principles for complex cooperative behavior—minimalism, statelessness and tolerance—and present a RoboCup soccer system that matches the sophistication of many deliberative soccer systems while exceeding their robustness, through the use of strict behavior-based techniques with no explicit communication.     

Optimal control of distributed bilinear systems

The optimal control problem for a bilinear distributed parameter system subject to a quadratic cost functional is solved. It is shown that the optimal control is given by a convergent power series in the state with tensor coefficients.