Results 261 to 270 of about 662,614 (319)

Algorithmic control of walking

Proceedings, 1989 International Conference on Robotics and Automation, 2003
The authors suggest that there are two components required in most control schemes: an algorithmic component which takes a high-level goal and generates joint trajectories, and a dynamics component which takes these joint trajectories and generates the required joint torques.
A. James Stewart, James F. Cremer
openaire   +1 more source

Benchmarking Force Control Algorithms

Proceedings of the 14th PErvasive Technologies Related to Assistive Environments Conference, 2021
Force control is nowadays a mature technology and it is becoming more and more common in robotic applications. A specific and significant example are robotic devices for rehabilitation. Despite this, an effective standardized and comprehensive method to assess force control performance does not exist.
Rudy Vicario   +7 more
openaire   +1 more source

Algorithm for Traffic Control

Operations Research, 1964
A linear control algorithm is proposed for the computer operation of a signalized traffic intersection. A theoretical analysis of the algorithm under the assumption of constant vehicular arrival and departure rates shows that the control is stable under unsaturated conditions, and with proper choice of control constants usually gives a rapid ...
Dunne, M. C., Potts, R. B.
openaire   +2 more sources

Dynamic control of a bicgstab algorithm

Applied Numerical Mathematics, 2000
The aim of this paper is to present a dynamic strategy which allows to detect breakdowns and near-breakdowns and to choose between a look ahead technique and a restart in the BICGSTAB algorithm for solving non-Hermitian sparse linear systems. First, it is recalled how the algorithm can be introduced by means of the formal orthogonal polynomial theory ...
Montagnac, Marc, Chesneaux, Jean-Marie
openaire   +2 more sources

On the weight controllability of consensus algorithms

2013 European Control Conference (ECC), 2013
In this paper we consider controllability of leader-follower networks running a consensus algorithm. We allow the communication links between the agents to be weighted and give the necessary and sufficient conditions for a the system to be controllable generically, i.e. for almost all choices of weights.
Goldin, D., Raisch, J.
openaire   +2 more sources

Algorithms for inference control

Microprocessing and Microprogramming, 1991
Abstract In this paper a method to deal with the inference problem is presentted. The database is represented with a directed bipartite graph. At each clearance level, different portions of the graph are accessible. Then, inference is defined as the existence of a ‘virtual’ cycle of information flow, at any classification level. The method we present
Achilles Kameas   +2 more
openaire   +1 more source

Supervision of Adaptive Control Algorithms

IFAC Proceedings Volumes, 1997
It is often argued that a difference between rule-based adaptive controllers and model-based adaptive controllers is that the rule-based controllers perform the adaptation after major disturbances, whereas model-based controllers perform a continuous adaptation. The authors show that this is not true.
Tore Hägglund, Karl Johan Åström
openaire   +2 more sources

Randomized algorithms in robust control

42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), 2004
The probabilistic approach to analysis and design of robust control systems is an emerging philosophy that gained increasing interest in the past. Opposed to the so-far dominating paradigm of deterministic worst-case robustness, the probabilistic approach presents itself as a natural tool to deal with the random character of uncertainties affecting ...
G Calafiore, F Dabbene, R Tempo
openaire   +3 more sources

Home - About - Disclaimer - Privacy