S. Kato, S. Nishiyama, and J. Takeno, "Coordinating mobile robots by applying traffic rules," in Proc. IEEE Int. Conf. Intelligent Robots and Systems, IROS'92, vol. 3, Raleigh, NC, July 1992, p. 1535ff.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....trajectories. To relax the problem of searching through highdimensional configuration spaces, several decentralized motion planning strategies have been developed. Their distributed nature allows for tractable solutions in high dimensional configuration spaces and even real time planning [14]. Reactive style planning is one type of decentralized planning that has proven suitable for many applications because it is fast, enabling real time planning. A common reactive approach is Potential fields [15] This approach has been applied to both single robots and extended to multi robot ....

S. Kato, S. Nishiyama, & J. Takeno, "Coordinating mobile robots by applying traffic rules", Proceedings of the 1992.

....[9] 24] 28] among which [9] 28] assign priorities to robots in advance. In decentralized planning, each robot plans individually for itself by means of collecting information from other robots and environmental information around the robot. Decen tralized planning work includes [2] 6] [15], where [15] applies traffic rules and is suitable for the route net work; 2] uses dynamic priority assignment and nego tiation to solve the coordination and conflict problem; and [6] randomly chooses one robot to stop and inserts random time delays to resolve the potential collision. Our ....

....[28] among which [9] 28] assign priorities to robots in advance. In decentralized planning, each robot plans individually for itself by means of collecting information from other robots and environmental information around the robot. Decen tralized planning work includes [2] 6] 15] where [15] applies traffic rules and is suitable for the route net work; 2] uses dynamic priority assignment and nego tiation to solve the coordination and conflict problem; and [6] randomly chooses one robot to stop and inserts random time delays to resolve the potential collision. Our algorithm is a ....

S. Karo, S. Nishiyama, and J. Takeno. Coordinating mobile robots by applying traffic rules. In Proceedings of the 1992.

....but use a centralized mechanism to merge the trajectories, so that no collisions and deadlocks can occur. The centralized mechanism requires that a robot is able to send broadcast messages to all other robots, leading to high demands on communication abilities of the robots. Kato et al.[5], in contrast, demand no communication abilities of the robots at all. They use traffic rules which, if obeyed by all robots, ensure collision and deadlock free operation of the whole system. They, however, make some very special assumptions about the environment. Chun et al. 6] also do not ....

S. Kato, S. Nishiyama, and J. Takeno, Coordinating Mobile Robots by Applying Traffic Rules, International Conference on Intelligent Robots and Systems (IROS), pp. 1535-1541, 1992

....applet. Thus, communication is centralized. In contrast, each robot and applet works autonomously and cooperatively. This implies that control is distributed. Such duality for communication and control is the most distinctive feature of our proposed approach to Web based multiple robotics(e.g. 1][3][4] 5] 9 Conclusions In this paper we describe a unified method for communication with and control of robots. The unification comes from the use of Web technologies such as browsers, Java language, and various socket communications. Our future work includes the accessibility of the Web top ....

S. Kato, S. Nishiyama, and J. Takeno, "Coordinating mobile robots by applying traffic rules," IROS'92 pp.1535-1541,1992

....distinguishes between two significantly different types of group behaviors that are found in 21 Analysis in [Gro88] shows that restricted roads are highly suboptimal, and that the autonomous road choice coupled with a greedy policy for escaping blocked situations is far more effective. 22 In [KNT92] robots follow preplanned paths and use rules for collision avoidance. Example rules include keep right , stop at intersection , keep sufficient space to the robot in front of you , etc. AOI 91] solves collision avoidance using two simple rules and a communication protocol that resolves ....

S. Kato, S. Nishiyama, and J. Takeno. Coordinating mobilerobots byapplying traffic rules. In IEEE/RSJ IROS, 1535--1541, 1992.

....for execution and control of a large fleet of autonomous mobile robots. The robots incrementally merge their plans into a set of already coordinated plans, through exchange of information about their current state and their future actions. Planners based on traffic rules are described in [Gro88, KNT92, Wan95, WP95, LLC 95] Some recent work on decoupled planners experimented with on real robots includes [CE92, CFA 95, SG96] As is the case in general for decoupled methods, these planners do not work well in very constrained environments. Weaker centralisation: Roadmap coordination As ....

S. Kato, S. Nishiyama, and J. Takeno. Coordinating mobile robots by applying traffic rules. In IEEE IROS '92, Raleigh, North Carolina, USA, July 1992.

....situations is far more effective (cf. modest cooperation [Premvuti and Yuta, 1990] where robots are assumed to be benevolent for the common good of the system) Solutions to the traffic control problem range from rule based solutions to approaches with antecedents in distributed processing. In [Kato et al. 1992], robots follow pre planned paths and use rules for collision avoidance. Example rules include keep right , stop at intersection , and keep sufficient space to the robot in front of you . Asama et al. 1991c] solves collision avoidance using two simple rules and a communication protocol that ....

S. Kato, S. Nishiyama, and J. Takeno. Coordinating mobile robots by applying traffic rules. In IEEE/RSJ IROS, pages 1535--1541, 1992.

....for escaping blocked situations is far more effective (cf. modest cooperation [137] where robots are assumed to be benevolent for the common good of the system) Solutions to the traffic control problem range from rule based solutions to approaches with antecedents in distributed processing. In [84], robots follow pre planned paths and use rules for collision avoidance. Example rules include keep right , stop at intersection , and keep sufficient space to the robot in front of you . 19] solves collision avoidance using two simple rules and a communication protocol that resolves conflict ....

S. Kato, S. Nishiyama, and J. Takeno. Coordinating mobile robots by applying traffic rules. In IEEE/RSJ IROS, pages 1535--1541, 1992.

No context found.

S. Kato, S. Nishiyama, and J. Takeno, "Coordinating mobile robots by applying traffic rules," in Proc. IEEE Int. Conf. Intelligent Robots and Systems, IROS'92, vol. 3, Raleigh, NC, July 1992, p. 1535ff.

No context found.

S. Karo, S. Nishiyama, & J. Takeno. Coordinating mobile robots by applying traffic rules, Proc. IEEE/RSH Int. Conf. on Intelligent Robots and Systems, p. 1535-1541, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC