| L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3):231--255, 2002. |
....mesh. Safaric et al. Ku et al. 2001] designed a distributed control system for an active surface device. The active surface device is a massive parallel micro actuator array that can generate a pressure field on a planar surface. Applications of distributed algorithms include motion planing [ Parker, 2002] localization [Hayes et al. 2001, Mumolo et al. 2000] and task allocation [Agassounon et al. 2001, Chen et al. 1999] In independent work, Kimber and Liu et al. describe a multi user robot camera in [Kimber et al. 2002, Liu et al. 2002] As we do in Sharecam, they formulate the frame ....
Parker, L. (2002). Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3):231--255.
.... being proposed; e.g. see [26] 27] and the conference versions of this work [28] 29] Heuristic approaches to the design of interaction rules and emerging behaviors have been throughly investigated within the literature on behavior based robotics; see [30] 31] 32] 17] 33] 34] 35] [36]. An example of coverage control is discussed in [37] Along this line of research, algorithms have been designed for sophisticated cooperative tasks. However, no formal results are currently available on how to design reactive control laws, ensure their correctness, and guarantee their optimality ....
L. E. Parker, "Distributed algorithms for multi-robot observation of multiple moving targets," Autonomous Robots, vol. 12, no. 3, pp. 231--55, 2002.
No context found.
L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. under revision for publication in Autonomous Robots, 2001.
....so forth. Many other subproblems can also be addressed, including the physical tracking of targets (e.g. using vision, sonar, IR, or laser range) prediction of target movements, multi sensor fusion, and so forth. A HAND GENERATED SOLUTION TO CMOMMT We have developed a hand generated solution [17, 18] to the CMOMMT problem that performs well when compared to various control approaches. This solution has been implemented on both physical and simulated robots to demonstrate its e ectiveness. The hand generated solution, which we call A CMOMMT, is described brie y as follows. Robots use weighted ....
....to robots greater than 1 2. We compared the hand generated ACMOMMT approach with a non weighted local force vector approach, as well as two control cases in which robots either maintained xed positions or are moved randomly. Figure 3 gives a typical set of these comparative results. Refer to [17] for more details on these results. LEARNING IN THE CMOMMT APPLICATION We have studied the CMOMMT problem from a learning perspective without the assumption of an a priori model [19] This approach uses a combination of reinforcement learning, lazy learning, and a Pessimistic algorithm able to ....
L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. To appear in Autonomous Robots, 2000.
No context found.
L. E. Parker, "Distributed algorithms for multi-robot observation of multiple moving targets," to appear in Autonomous Robots , 1999.
No context found.
L. E. Parker, "Distributed algorithms for multi-robot observation of multiple moving targets," accepted for publication in Autonomous Robots , 1999.
No context found.
L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3):231--255, 2002.
No context found.
L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving target. Autonomous Robots, 12(3), 2002.
No context found.
L. Parker, Distributed algorithms for multi-robot observation of multiple moving targets, Autonomous Robots 12(3) (2002).
No context found.
L.E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3), 2002.
No context found.
L. E. Parker, "Distributed algorithms for multi-robot observation of multiple moving targets," Autonomous Robots, vol. 12, no. 3, pp. 231-- 255, 2002.
No context found.
L. E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3):231--255, 2002.
No context found.
L.E. Parker. Distributed algorithms for multi-robot observation of multiple moving targets. Autonomous Robots, 12(3), 2002.
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