algorithmssynthesis is a new approach in the field of design and analysis of algorithms. Darlington (1978) presented a tree structure starting from a high level definition (by defining permutation function) as root-...
详细信息
algorithmssynthesis is a new approach in the field of design and analysis of algorithms. Darlington (1978) presented a tree structure starting from a high level definition (by defining permutation function) as root-node and finally obtaining 6 terminal-nodes corresponding to each sorting algorithm he discussed. The algorithms-synthesis approach starts from a high level definition and ultimately results in the required algorithms. An attempt is made to synthesize some scheduling algorithms starting, as Darlington did, from a high level definition, and using program transformation techniques. Three scheduling algorithms are taken into the synthesis: 1. First-Come-First-Serve, 2. Round-Robin, and 3. Selfish-Round-Robin. The rules applied are mainly the unfolding-and-folding technique as examined by Burstall and Darlington (1977).
The synthesis of open-loop and closed-loop position and force control algorithms for a semiautomatic control system of a robot-manipulator has been performed. Computer models have been developed for a position-force c...
详细信息
The synthesis of open-loop and closed-loop position and force control algorithms for a semiautomatic control system of a robot-manipulator has been performed. Computer models have been developed for a position-force control system with reconfigurable structure for a robot performing standard operations set by a human operator with a 3-degree-of-freedom handle Animated computer simulation of dynamic processes in a system with different control algorithms has been performed and their precision characteristics have been evaluated. Some practical recommendations are given on the application of the achieved results for the development of training simulators for human supervisors of robot control systems. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Simulation-based analyses of cyber-physical systems are becoming increasingly vital. Co-simulation is one such technique that enables the coupling of specialized simulation tools through an orchestration algorithm tha...
详细信息
ISBN:
(纸本)9781565553750
Simulation-based analyses of cyber-physical systems are becoming increasingly vital. Co-simulation is one such technique that enables the coupling of specialized simulation tools through an orchestration algorithm that dictates when, with which inputs, and how far each simulation tool should advance its corresponding subsystem. The result of a co-simulation is often sensitive to the orchestration algorithm. This algorithm should be designed based on the simulation tool's implementation to minimize the co-simulation error. The paper extends current graph-based approaches for generating implementation-aware simulation algorithms to cover complex co-simulation scenarios where step negotiation and algebraic loops are part of the simulation. We show how the generation takes place for different complex co-simulation scenarios. An implementation of the approach is available online.
暂无评论