This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
We consider a class of hybrid dynamical systems and obtain conditions under which the behavior of these systems can be reduced to a finite state automaton. Specifically, we consi...
S. Di Gennaro, C. Horn, Sanjeev R. Kulkarni, Peter...
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
This paper proposes a new trajectory generation method that allows full control of transient behavior, namely, time-to-target and velocity profile, based on the artificial potentia...
Toshio Tsuji, Yoshiyuki Tanaka, Pietro Morasso, Vi...