一种多进程实时控制系统的软件设计

本文提出了一种时间片预分割方案,并将其用于多进程实时控制系统的软件设计,其特点是程序设计简单、维护方便,尤其是提高了系统运行的可靠性。     

用银河仿真机进行固体火箭姿态控制系统半实物仿真试验

本文介绍用YH-F_1仿真机进行固体火箭姿态控制系统半实物仿真试验的系统配置、仿真程序设计和仿真模型检验.     

LISP跳棋程序与启发式搜索

本文叙述了在IBM-PC个人计算机上,研制成功的LISP跳棋智能程序中,如何成功地使用启发式搜索进行设计的方法,特别对作者自行设计的顺序递归搜索算法进行了分析和评价。     

洗衣机用水量的优化设计

本文对洗衣机运转过程中的用水量建立优化模型，目标函数为在达到一定洗涤效果的前提下的最小用水量。我们将此归结为利用Ｌａｇｒａｎｇｅ函数求非线性规划的最优解问题，并且给出了相应的理论证明。此外，结合实际具体数据为洗衣机设计了一组运行程序。最后讨论了模型的改进与推广，并且对模型的优缺点作出了分析。     

Hybrid partition- and network-level scheduling design for distributed integrated modular avionics systems

Distributed Integrated Modular Avionics (DIMA) develops from Integrated Modular Avionics (IMA) and realizes distributed integration of multiple sub-function areas. Time-triggered network provides effective support for time synchronization and information coordination in DIMA systems. However, inconsistency between processing resources and communication network destroys the time determinism benefiting from partitions and time-triggered mechanism. To ensure such time determinism and achieve guaranteed real-time performance, system design should collectively provide a global communication scheme for messages in network domain and a corresponding execution scheme for partitions in processing domain. This paper firstly establishes a general DIMA model which coordinates partitioned processing and time-triggered communication, and then proposes a hybrid scheduling algorithm using Mixed Integer Programming to produce feasible system schemes. Furthermore, incrementally integrating new functions causes upgrades or reconfigurations of DIMA systems and will generate integration cost. To control such cost, this paper further develops an optimization algorithm based on Maximum Satisfiability Problem and guarantees that the scheduling design for upgraded DIMA systems inherit their original schemes as much as possible. Finally, two typical cases, including a simple fully connected DIMA system case and an industrial DIMA system case, are constructed to illustrate our DIMA model and validate the effectiveness of our hybrid scheduling algorithms.     

Obstacle avoidance handling and mixed integer predictive control for space robots

This paper presents a novel obstacle avoidance constraint and a mixed integer predictive control (MIPC) method for space robots avoiding obstacles and satisfying physical limits during performing tasks. Firstly, a novel kind of obstacle avoidance constraint of space robots, which needs the assumption that the manipulator links and the obstacles can be represented by convex bodies, is proposed by limiting the relative velocity between two closest points which are on the manipulator and the obstacle, respectively. Furthermore, the logical variables are introduced into the obstacle avoidance constraint, which have realized the constraint form is automatically changed to satisfy different obstacle avoidance requirements in different distance intervals between the space robot and the obstacle. Afterwards, the obstacle avoidance constraint and other system physical limits, such as joint angle ranges, the amplitude boundaries of joint velocities and joint torques, are described as inequality constraints of a quadratic programming (QP) problem by using the model predictive control (MPC) method. To guarantee the feasibility of the obtained multi-constraint QP problem, the constraints are treated as soft constraints and assigned levels of priority based on the propositional logic theory, which can realize that the constraints with lower priorities are always firstly violated to recover the feasibility of the QP problem. Since the logical variables have been introduced, the optimization problem including obstacle avoidance and system physical limits as prioritized inequality constraints is termed as MIPC method of space robots, and its computational complexity as well as possible strategies for reducing calculation amount are analyzed. Simulations of the space robot unfolding its manipulator and tracking the end-effector’s desired trajectories with the existence of obstacles and physical limits are presented to demonstrate the effectiveness of the proposed obstacle avoidance strategy and MIPC control method of space robots.     

Multiple-constraint cooperative guidance based on two-stage sequential convex programming

An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target. The problem with time-varying Proportional Navigation (PN) gain is first formulated as a nonlinear optimal control problem, which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints. After convexification treatments and discretization, the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming (SOCP) problems, which can be readily solved by state-of-the-art Interior-Point Methods (IPMs). To mitigate the sensibility of the algorithm on the user-provided initial profile, a Two-Stage Sequential Convex Programming (TSSCP) method is presented in detail. Furthermore, numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem. The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.     

基于改进GPC的无人直升机动态路径规划

针对小型无人直升机航迹受到风场扰动和导航系统定位误差影响下的航迹最优规划问题,建立了风扰动和导航误差影响下的飞行航迹线性模型。基于混合整数规划思想,采用粒子滤波改进广义模型预测控制算法实时规划航迹,降低了导航定位误差造成的航迹估计偏差,提高了航迹估计精度。仿真结果表明,该算法能够生成三维可行航迹并躲避障碍物,且规划时间和无人机能耗较传统方法显著减少。     

图形交互自动编程及对三维曲面的处理

作为一种新型的计算机辅助编程技术，图形交互自动编程正在走进更多的企业。本文介绍了这种编程方法的特点和基本步骤，重点阐述了利用这种办法处理传统编程方法不易解决的三维曲面编程问题。     

参数编程在数控车床上的应用

参数编程是西门子系统中一种先进的编程方法，与FANUC系统中的宏程序类同，它是使用参数变量来代替程序中的功能代码或地址值而编制的加工程序。这种参数，可示同因数一样进行逻辑运算，因而可以使复杂的程序大大简化。