feedback fuzzy-dvs scheduling of control tasks

To consider the energy-aware scheduling problem in computer-controlled systems is necessary to improve the control performance, to use the limited computing resource sufficiently, and to reduce the energy consumption to extend the lifetime of the whole system. In this paper, the scheduling problem of multiple control tasks is discussed based on an adjustable voltage processor. A feedback fuzzy-DVS (dynamic voltage scaling) scheduling architecture is presented by applying technologies of the feedback control and the fuzzy DVS. The simulation results show that, by using the actual utilization as the feedback information to adjust the supply voltage of processor dynamically, the high CPU utilization can be implemented under the precondition of guaranteeing the control performance, whilst the low energy consumption can be achieved as well. The proposed method can be applied to the design in computer-controlled systems based on an adjustable voltage processor.

achieving on-time delivery: a two-stage probabilistic scheduling strategy for software projects

Chinese Academy of Sciences (ISCAS)

value-based multiple software projects scheduling with genetic algorithm

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

Counterions in polyelectrolyte multilayers: A vehicle for introducing functionalities

Counterions present at the surface of polyelectrolyte multilayers were utilized for the introduction of charged species into the multilayer via ion exchange. A typical polyelectrolyte multilayer film with Na+ counterions in the outermost layer was immersed in an AgNO3 aqueous solution and the rapid ion-exchange process was complete within 1 min. The silver ions thus introduced were then reduced in situ and silver nanoparticles were produced at the surface of the multilayer assembly. This example demonstrates that the counterions naturally occurring in every polyelectrolyte multilayer film can be a convenient vehicle for the introduction of various functionalities to the film.

Multi-sensors data acquisition and information fusion for manned submersible vehicle

本文介绍了一种用于载人潜水器的导航传感器的数据采集及信息融合技术。航行控制计算机通过基于工业以太网的数据通信系统对各传感器进行数据采集,采用卡尔曼滤波器完成对各传感器数据信息的融合,以便提高数据的精度和控制系统的性能,并将结果送给监控计算机,用于载人潜水器的姿态显示。

“探索者”号自治式无缆水下机器人控制软件体系结构

本文详细介绍了我们为“探索者”号自治式无缆水下机器人（以下简称ＡＵＶ）设计的控制软件体系结构。该体系结构可分为使命控制，运动监控与设备操作，实时调度和实时处理四个不同的控制层次及一个全局数据区五部分。

A Scheduling Algorithm for Flexible Manufacturing Cell

In this paper, a new scheduling algorithm for the flexible manufacturing cell is presented, which is a discrete time control method with fixed length control period combining with event interruption. At the flow control level we determine simultaneously the production mix and the proportion of parts to be processed through each route. The simulation results for a hypothetical manufacturing cell are presented.

基于RFID的混流装配汽车生产线物料动态配送研究

针对混流装配的汽车自动化生产线提出了基于RFID的车辆追踪和基于条码的无线物料库存管理实现方法。在此基础上,设计了装配生产线的物料动态配送调度业务流程,给出了物料动态配送的规划依据,并进行了实例计算。

Heuristics for Job-Shop Scheduling

Two methods of obtaining approximate solutions to the classic General Job-shop Scheduling Program are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules. The selected space pruning constraints are then used to reduce the search space and the sampling is repeated. This approach can be used either to verify whether some set of space pruning constraints can prune with discrimination or to generate solutions directly. Schedules can be represented as trajectories through a Cartesian space. Under the objective criteria of Minimum maximum Lateness family of "good" schedules (trajectories) are geometric neighbors (reside with some "tube") in this space. This second method of generating solutions takes advantage of this adjacency by pruning the space from the outside in thus converging gradually upon this "tube." One the average this methods significantly outperforms an array of the Priority Dispatch rules when the object criteria is that of Minimum Maximum Lateness. It also compares favorably with a recent relaxation procedure.

Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels, or explicitly by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain less switches than the maximum. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations improves over the results obtained by a recent state-of-the-art Hybrid Genetic Algorithm for pump scheduling using level-controlled triggers.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.