Robust multiplexed MPC for distributed multi-agent systems

This paper extends the authors' earlier work which adapted robust multiplexed MPC for application to distributed control of multi-agent systems with non-interacting dynamics and coupled constraint sets in the presence of persistent unknown, but bounded disturbances. Specifically, we propose exploiting the single agent update nature of the multiplexed approach, and fix the update sequence to enable input move-blocking and increased discretisation rates. This permits a higher rate of individual policy update to be achieved, whilst incurring no additional computational cost in the corresponding optimal control problems to be solved. A disturbance feedback policy is included between updates to facilitate finding feasible solutions. The new formulation inherits the property of rapid response to disturbances from multiplexing the control and numerical results show that fixing the update sequence does not incur any loss in performance. © 2011 IFAC.

extending the boundary of spreadsheet programming: lessons learned from chinese governmental projects

ICSE

基于主动视觉和超声的机器人目标跟踪系统

运动目标跟踪技术是未知环境下移动机器人研究领域的一个重要研究方向。该文提出了一种基于主动视觉和超声信息的移动机器人运动目标跟踪设计方法,利用一台SONY EV-D31彩色摄像机、自主研制的摄像机控制模块、图像采集与处理单元等构建了主动视觉系统。移动机器人采用了基于行为的分布式控制体系结构,利用主动视觉锁定运动目标,通过超声系统感知外部环境信息,能在未知的、动态的、非结构化复杂环境中可靠地跟踪运动目标。实验表明机器人具有较高的鲁棒性,运动目标跟踪系统运行可靠。

可重构机器人体系结构及模块化控制系统的实现

本文提出了一种适用于新型可重构星球机器人的模块化控制系统,根据机构和运动特性,基于CAN总线和分布式控制器技术,将系统结构和功能分解成不同模块由各自的控制器独立执行,建立具有任务层和运动层的分层次控制结构,实现了组合式规划、分布式控制的混合式控制方法。本文设计了两种不同的控制器,并采用PPG脉冲宽度调节方法实现了对在机器人上使用的R/C电机的标定和控制。通过在子机器人原理样机上进行实验,验证了这套控制系统和控制体系结构的可行性。

仿人机器人控制系统的研究与实现

根据仿人机器人控制性能的要求,设计开发了关节控制器,并通过CAN总线把各个关节控制器、力传感器及上位机连接在一起,构成了分布式控制系统.利用无线局域网技术,实现了语音、视频等多媒体信息的传输,把监控台、头部、上身和移动平台连接在一起,构成了仿人机器人完整的控制系统.最后提出了一些设想以提高系统的性能.

仿人机器人系统的研究与实现

针对仿人机器人的结构和控制性能的要求,设计开发了机器人的关节控制器,并利用CAN总线把各个关节和力传感器及上位机连接在一起,构成了有效可靠的分布式控制系统;利用无线局域网技术,实现了语音、视频等多媒体信息的传输,构成了仿人机器人完整的控制系统。最后提出了一些设想以提高系统的性能。

基于CAN总线的分布式数据采集与控制系统

随着电子技术和计算机技术的不断发展，工业生产过程的控制系统正在向着智能化、数字化和网络化的方向发展。传统的集散控制方式和计算机分层控制方式已经开始让位于智能终端与网络结合的总线网络控制方式。当今，在工厂中过程控制环境下的分布式自动化系统变得越来越复杂，尤其系统内部的各设备之间需要快速交换大量的信息，以便实现对被控系统更为精确的控制和提供一些辅助的评价函数。这就意味着要不断增加带宽和提高通信速率以满足网络通信的需要。在现有的多种可利用网络设备中，CAN总线以其清晰的定义、极高的可靠性及其独特的设计，被认为是最能有效地解决这一问题的途径之一。而且市场上基于通信技术的产品中，就实时性考虑，由于CAN总线采用的非表意性的通信方式，因此其结构更为简单，实时性更好。基于此背景，我们以CAN总线作为通信媒介，将分布于各控制现场的传感器、执行器和控制器有序地连接起来，构成了一个基于CAN总线的分布式局域网络控制系统。本文首先介绍了基于CAN总线的分布式数据采集与控制系统的总体结构。然后从硬件方面描述了基于CAN总线的通信协议转换单元、数据采集单元和输出控制单元的功能、硬件配置及各单元功能的具体实现过程，给出了各单元的性能指标。软件方面，以C语言作为平台，开发了基于CAN总线的上位计算机管理与监控软件，实现了对整个网络设备的系统管理和系统控制功能。对于该总线系统，作者运用了PID控制和模糊控制算法实现了对水箱液位的控制，达到了理想的效果。基于CAN总线的控制系统很好地解决了集散控制系统难以解决的难题，模糊控制的应用能很好地把总线控制系统应用到具有非线性、大时滞和难于获得精确模型的控制系统中。

地下水流动数值模拟的并行计算方法研究

Numerical modeling of groundwater is very important for understanding groundwater flow and solving hydrogeological problem. Today, groundwater studies require massive model cells and high calculation accuracy, which are beyond single-CPU computer’s capabilities. With the development of high performance parallel computing technologies, application of parallel computing method on numerical modeling of groundwater flow becomes necessary and important. Using parallel computing can improve the ability to resolve various hydro-geological and environmental problems. In this study, parallel computing method on two main types of modern parallel computer architecture, shared memory parallel systems and distributed shared memory parallel systems, are discussed. OpenMP and MPI (PETSc) are both used to parallelize the most widely used groundwater simulator, MODFLOW. Two parallel solvers, P-PCG and P-MODFLOW, were developed for MODFLOW. The parallelized MODFLOW was used to simulate regional groundwater flow in Beishan, Gansu Province, which is a potential high-level radioactive waste geological disposal area in China. 1. The OpenMP programming paradigm was used to parallelize the PCG (preconditioned conjugate-gradient method) solver, which is one of the main solver for MODFLOW. The parallel PCG solver, P-PCG, is verified using an 8-processor computer. Both the impact of compilers and different model domain sizes were considered in the numerical experiments. The largest test model has 1000 columns, 1000 rows and 1000 layers. Based on the timing results, execution times using the P-PCG solver are typically about 1.40 to 5.31 times faster than those using the serial one. In addition, the simulation results are the exact same as the original PCG solver, because the majority of serial codes were not changed. It is worth noting that this parallelizing approach reduces cost in terms of software maintenance because only a single source PCG solver code needs to be maintained in the MODFLOW source tree. 2. P-MODFLOW, a domain decomposition–based model implemented in a parallel computing environment is developed, which allows efficient simulation of a regional-scale groundwater flow. The basic approach partitions a large model domain into any number of sub-domains. Parallel processors are used to solve the model equations within each sub-domain. The use of domain decomposition method to achieve the MODFLOW program distributed shared memory parallel computing system will process the application of MODFLOW be extended to the fleet of the most popular systems, so that a large-scale simulation could take full advantage of hundreds or even thousands parallel processors. P-MODFLOW has a good parallel performance, with the maximum speedup of 18.32 (14 processors). Super linear speedups have been achieved in the parallel tests, indicating the efficiency and scalability of the code. Parallel program design, load balancing and full use of the PETSc were considered to achieve a highly efficient parallel program. 3. The characterization of regional ground water flow system is very important for high-level radioactive waste geological disposal. The Beishan area, located in northwestern Gansu Province, China, is selected as a potential site for disposal repository. The area includes about 80000 km2 and has complicated hydrogeological conditions, which greatly increase the computational effort of regional ground water flow models. In order to reduce computing time, parallel computing scheme was applied to regional ground water flow modeling. Models with over 10 million cells were used to simulate how the faults and different recharge conditions impact regional ground water flow pattern. The results of this study provide regional ground water flow information for the site characterization of the potential high-level radioactive waste disposal.

Revised Report on the Algorithmic Language Scheme

Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the Lambda Order they are all first-class. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all first-class. Keywords: Scheme, Lisp, functional programming, computer languages.

Robust Agent Control of an Autonomous Robot with Many Sensors and Actuators

This thesis presents methods for implementing robust hexpod locomotion on an autonomous robot with many sensors and actuators. The controller is based on the Subsumption Architecture and is fully distributed over approximately 1500 simple, concurrent processes. The robot, Hannibal, weighs approximately 6 pounds and is equipped with over 100 physical sensors, 19 degrees of freedom, and 8 on board computers. We investigate the following topics in depth: distributed control of a complex robot, insect-inspired locomotion control for gait generation and rough terrain mobility, and fault tolerance. The controller was implemented, debugged, and tested on Hannibal. Through a series of experiments, we examined Hannibal's gait generation, rough terrain locomotion, and fault tolerance performance. These results demonstrate that Hannibal exhibits robust, flexible, real-time locomotion over a variety of terrain and tolerates a multitude of hardware failures.

Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk

Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstations|and other distributed memory architectures in general|based on the Bulk Synchronous Parallel (BSP) model. BSPk emphasizes efficiency in communication by minimizing local memory-to-memory copying, and in barrier synchronization by not forcing a process to wait unless it needs remote data. Both the message passing (MP) and distributed shared memory (DSM) programming styles are supported in BSPk. MP helps processes efficiently exchange short-lived unnamed data values, when the identity of either the sender or receiver is known to the other party. By contrast, DSM supports communication between processes that may be mutually anonymous, so long as they can agree on variable names in which to store shared temporary or long-lived data.