S／T曲线速度规划在定点DSP上的实现

本文将S／T曲线速度规划的思想引入全数字伺服驱动系统中,通过提高速度的平滑性,特别是高速启、制动状态,来提高伺服系统的整体控制性能。基于定点数字信号处理器DSP芯片对提出的算法进行了实现。由于定点运算的限制,算法在实现中需要进行特殊的处理,本文对此进行了研究,并提出了一种余码补偿方案。实验研究表明,使用本文提出的方法可以提高系统运行的平稳性和控制的精确度。

模块化嵌入式机器人控制单元设计

针对当前机器人控制器设计开发过程中存在的问题,提出了以DSP为核心的模块化控制单元设计方法。采用DSP为微控制器,提高了运算速度,增强了控制性能。控制单元由CPU、驱动、通讯、I／O等模块组合而成,可以通过增减模块实现功能的重组,使系统具有一定的开放性,实现了功能的可配置。

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

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

一种轮式移动机器人实时速度估计方法

环境和机器人自身的不确定性影响轮式移动机器人的轨迹跟踪控制性能,此时仅仅使用里程计往往不能正确表达机器人的状态信息。在无速度传感器的情况下,讨论了使用加速度传感器和位置传感器的输出实时估计轮式移动机器人的速度。首先使用滑模观测器进行里程计信号处理,然后对车体加速度信号进行带通滤波提取车体扰动信息,通过频域融合信号表达轮式移动机器人的速度,并针对正交轮式全方位移动机器人进行了轨迹跟踪控制研究。试验结果表明采用融合数据可以更准确提供机器人的状态信息并得到更好的控制性能。

无锁存功能脉冲计数器的改进读取方法

在电机伺服控制系统中,需要一个脉冲计数器对电机码盘输出的脉冲进行计数。但是如果脉冲计数器没有数据锁存功能,单片机读出的数值可能不准确,进而影响伺服控制系统的性能。针对没有锁存功能的脉冲计数器,提出了一种改进的读取方法,有效的避免了在读取过程中由于计数器进位或借位造成的读数偏差。

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

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

基于CAN的仿人机器人控制器的设计与实现

本文针对仿人机器人的结构和控制性能的要求,设计并实现了基于CAN的关节控制器,并利用CAN把各个关节和力传感器及上位机连接在一起,构成了有效可靠的控制系统。主要包括仿人机器人的总体结构、控制器的硬件与软件的设计实现、控制系统的拓扑结构等,并提出了一些设想以提高系统的性能。

一种遥控潜水器控制系统的研究与应用

介绍一种基于工业以太网通信技术及Windows平台构建的遥控潜水器控制系统.将该控制系统应用于最新研制的遥控潜水器中,其在通信能力、视频传输、控制性能、硬件的可扩展性、数据的存储与显示等多方面都比传统的控制系统具有明显的优势.在水池中进行了试验,验证了该控制系统及整个潜水器良好的运动功能和性能.

基于多智能体的制造系统生产控制建模研究

为提高制造系统生产控制的性能,建立了基于多智能体系统的混合控制模型。该模型把生产控制系统分为管理智能体层、单元智能体层和执行智能体层。管理智能体层负责调度和协调各单元智能体,并对所有智能体进行管理;单元智能体层中的各单元智能体间通过公用数据库相互协作;执行智能体对制造系统内的硬件负责,它们根据局部的本地资源信息及当前状态,接收发布的任务,并对其求解。同一层次的智能体之间是分布式结构。采用基于多智能体的混合控制模式,提高了制造系统生产控制的实时性和灵活性。通过激光拼焊生产系统中的试验,验证了该模型的有效性。

通过语言任务和功能磁共振成像研究人类小脑功能

Since the 19th century, people have long believed that the function of cerebellum was restricted to fine motor control and modulation. In the past two decades, however, more and more studies challenged this traditional view. While the neuroanatomy of the cerebellum from cellular to system level has been well documented, the functions of this neural organ remain poorly understood. This study, including three experiments, attempted to further the understanding of cerebellar functions from different viewpoints. Experiment One used the parametric design to control motor effects. The activation in cerebellum was found to be associated with the difficulty levels of a semantic discrimination task, suggesting the involvement of the cerebellum in higher level of language functions. Moreover, activation of the right posterior cerebellum was found to co-vary with that of the frontal cortex. Experiment Two adopted the cue-go paradigm and event-related design to exclude the effects of phonological and semantic factors in a mental writing task. The results showed that bilateral anterior cerebellum and cerebral motor regions were significantly activated during the task and the hemodynamic response of the cerebellum was similar to those of the cerebral motor cortex. These results suggest that the cerebellum participates in motor imagination during orthographic output. Experiment Three investigated the learning process of a verb generation task. While both lateral and vermis cerebellum were found to be activation in the task, each was correlated a separate set of frontal regions. More importantly, activations both in the cerebellum and frontal cortex decreased with the repetition of the task. These results indicate that the cerebellum and frontal cortex is jointly engaged in some functions; each serves as a part of a single functional system. Taken these findings together, the following conclusions can be drawn: 1.The cerebellum is not only involved in functions related to speech or articulation, but also participates in the higher cognitive functions of language. 2.The cerebellum participates in various functions by supporting the corresponding regions in cerebral cortex, but not directly executes the functions as an independent module. 3.The anterior part of cerebellum is related to motor functions, whereas the posterior part is involved in cognitive functions. 4.While the motor functions rely on the engagement of both sides of the cerebellar hemispheres, the higher cognitive functions mainly depend on the right cerebellum.

A Theory of How the Brain Might Work

I wish to propose a quite speculative new version of the grandmother cell theory to explain how the brain, or parts of it, may work. In particular, I discuss how the visual system may learn to recognize 3D objects. The model would apply directly to the cortical cells involved in visual face recognition. I will also outline the relation of our theory to existing models of the cerebellum and of motor control. Specific biophysical mechanisms can be readily suggested as part of a basic type of neural circuitry that can learn to approximate multidimensional input-output mappings from sets of examples and that is expected to be replicated in different regions of the brain and across modalities. The main points of the theory are: -the brain uses modules for multivariate function approximation as basic components of several of its information processing subsystems. -these modules are realized as HyperBF networks (Poggio and Girosi, 1990a,b). -HyperBF networks can be implemented in terms of biologically plausible mechanisms and circuitry. The theory predicts a specific type of population coding that represents an extension of schemes such as look-up tables. I will conclude with some speculations about the trade-off between memory and computation and the evolution of intelligence.

Staged Competence Learning in Developmental Robotics

M.H. Lee, Q. Meng and F. Chao, 'Staged Competence Learning in Developmental Robotics', Adaptive Behavior, 15(3), pp 241-255, 2007. the full text will be available in September 2008

Timeliness via Speculation for Real-Time Databases

Various concurrency control algorithms differ in the time when conflicts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency Control (PCC and OCC) alternatives represent two extremes. PCC locking protocols detect conflicts as soon as they occur and resolve them using blocking. OCC protocols detect conflicts at transaction commit time and resolve them using rollbacks (restarts). For real-time databases, blockages and rollbacks are hazards that increase the likelihood of transactions missing their deadlines. We propose a Speculative Concurrency Control (SCC) technique that minimizes the impact of blockages and rollbacks. SCC relies on the use of added system resources to speculate on potential serialization orders and to ensure that if such serialization orders materialize, the hazards of blockages and roll-backs are minimized. We present a number of SCC-based algorithms that differ in the level of speculation they introduce, and the amount of system resources (mainly memory) they require. We show the performance gains (in terms of number of satisfied timing constraints) to be expected when a representative SCC algorithm (SCC-2S) is adopted.

TCP Boston: A Fragmentation-tolerant TCP Protocol for ATM Networks

The popularity of TCP/IP coupled with the premise of high speed communication using Asynchronous Transfer Mode (ATM) technology have prompted the network research community to propose a number of techniques to adapt TCP/IP to ATM network environments. ATM offers Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services for best-effort traffic, such as conventional file transfer. However, recent studies have shown that TCP/IP, when implemented using ABR or UBR, leads to serious performance degradations, especially when the utilization of network resources (such as switch buffers) is high. Proposed techniques-switch-level enhancements, for example-that attempt to patch up TCP/IP over ATMs have had limited success in alleviating this problem. The major reason for TCP/IP's poor performance over ATMs has been consistently attributed to packet fragmentation, which is the result of ATM's 53-byte cell-oriented switching architecture. In this paper, we present a new transport protocol, TCP Boston, that turns ATM's 53-byte cell-oriented switching architecture into an advantage for TCP/IP. At the core of TCP Boston is the Adaptive Information Dispersal Algorithm (AIDA), an efficient encoding technique that allows for dynamic redundancy control. AIDA makes TCP/IP's performance less sensitive to cell losses, thus ensuring a graceful degradation of TCP/IP's performance when faced with congested resources. In this paper, we introduce AIDA and overview the main features of TCP Boston. We present detailed simulation results that show the superiority of our protocol when compared to other adaptations of TCP/IP over ATMs. In particular, we show that TCP Boston improves TCP/IP's performance over ATMs for both network-centric metrics (e.g., effective throughput) and application-centric metrics (e.g., response time).

Exploiting Redundancy for Timeliness in TCP Boston

While ATM bandwidth-reservation techniques are able to offer the guarantees necessary for the delivery of real-time streams in many applications (e.g. live audio and video), they suffer from many disadvantages that make them inattractive (or impractical) for many others. These limitations coupled with the flexibility and popularity of TCP/IP as a best-effort transport protocol have prompted the network research community to propose and implement a number of techniques that adapt TCP/IP to the Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services in ATM network environments. This allows these environments to smoothly integrate (and make use of) currently available TCP-based applications and services without much (if any) modifications. However, recent studies have shown that TCP/IP, when implemented over ATM networks, is susceptible to serious performance limitations. In a recently completed study, we have unveiled a new transport protocol, TCP Boston, that turns ATM's 53-byte cell-oriented switching architecture into an advantage for TCP/IP. In this paper, we demonstrate the real-time features of TCP Boston that allow communication bandwidth to be traded off for timeliness. We start with an overview of the protocol. Next, we analytically characterize the dynamic redundancy control features of TCP Boston. Next, We present detailed simulation results that show the superiority of our protocol when compared to other adaptations of TCP/IP over ATMs. In particular, we show that TCP Boston improves TCP/IP's performance over ATMs for both network-centric metrics (e.g., effective throughput and percent of missed deadlines) and real-time application-centric metrics (e.g., response time and jitter).