[图书][B] Planning algorithms

SM LaValle - 2006 - books.google.com
Planning algorithms are impacting technical disciplines and industries around the world,
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …

Synchronizing automata and the Černý conjecture

MV Volkov - International conference on language and automata …, 2008 - Springer
Synchronizing Automata and theˇCerný Conjecture Page 1 Synchronizing Automata and
theˇCerný Conjecture Mikhail V. Volkov Department of Mathematics and Mechanics, Ural State …

Robotics

D Halperin, LE Kavraki, K Solovey - Handbook of discrete and …, 2017 - taylorfrancis.com
Robotics is concerned with the generation of computer-controlled motions of physical
objects in a wide variety of settings. Because physical objects define spatial distributions in 3 …

Černý's conjecture and the road colouring problem

J Kari, MV Volkov - Handbook of automata theory, 2021 - ems.press
Let A be a complete deterministic finite automaton (DFA) with input alphabet A and state set
Q. We say that such an automaton is synchronising if there exists a word w 2 A such that …

Trap design for vibratory bowl feeders

RP Berretty, K Goldberg, MH Overmars… - … Journal of Robotics …, 2001 - journals.sagepub.com
The vibratory bowl feeder is the oldest and still most common approach to the automated
feeding (orienting) of industrial parts. In this paper, the authors consider a class of vibratory …

Secure recovery procedure for manufacturing systems using synchronizing automata and supervisory control theory

LVR Alves, PN Pena - IEEE Transactions on Automation …, 2020 - ieeexplore.ieee.org
Manufacturing systems may be subject to external attacks and failures, so it is important to
deal with the recovery of the system after these situations. This article deals with the problem …

Synchronization of finite automata

MV Volkov - 2022 - elar.urfu.ru
A survey of the state-of-the-art of the theory of synchronizing automata is given in its part
concerned with the case of complete deterministic automata. Algorithmic and complexity …

Manipulating algebraic parts in the plane

AS Rao, KY Goldberg - IEEE Transactions on Robotics and …, 1995 - ieeexplore.ieee.org
When manipulating parts, it is important to determine the orientation of the part with respect
to the gripper. This orientation may not be known precisely or may be disturbed by the act of …

Computing fence designs for orienting parts

RP Berretty, K Goldberg, MH Overmars… - Computational …, 1998 - Elsevier
A common task in automated manufacturing processes is to orient parts prior to assembly.
We consider sensorless orientation of a polygonal part by a sequence of fences. We show …

On the competitive complexity of navigation tasks

C Icking, T Kamphans, R Klein, E Langetepe - Sensor Based Intelligent …, 2002 - Springer
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving
any instance t of T does not exceed r times the cost of solving t optimally. The competitive …