Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tucker R. Balch is active.

Publication


Featured researches published by Tucker R. Balch.


international conference on robotics and automation | 1998

Behavior-based formation control for multirobot teams

Tucker R. Balch; Ronald C. Arkin

New reactive behaviors that implement formations in multirobot teams are presented and evaluated. The formation behaviors are integrated with other navigational behaviors to enable a robotic team to reach navigational goals, avoid hazards and simultaneously remain in formation. The behaviors are implemented in simulation, on robots in the laboratory and aboard DARPAs HMMWV-based unmanned ground vehicles. The technique has been integrated with the autonomous robot architecture (AuRA) and the UGV Demo II architecture. The results demonstrate the value of various types of formations in autonomous, human-led and communications-restricted applications, and their appropriateness in different types of task environments.


IEEE Transactions on Pattern Analysis and Machine Intelligence | 2005

MCMC-based particle filtering for tracking a variable number of interacting targets

Zia Khan; Tucker R. Balch; Frank Dellaert

We describe a particle filter that effectively deals with interacting targets, targets that are influenced by the proximity and/or behavior of other targets. The particle filter includes a Markov random field (MRF) motion prior that helps maintain the identity of targets throughout an interaction, significantly reducing tracker failures. We show that this MRF prior can be easily implemented by including an additional interaction factor in the importance weights of the particle filter. However, the computational requirements of the resulting multitarget filter render it unusable for large numbers of targets. Consequently, we replace the traditional importance sampling step in the particle filter with a novel Markov chain Monte Carlo (MCMC) sampling step to obtain a more efficient MCMC-based multitarget filter. We also show how to extend this MCMC-based filter to address a variable number of interacting targets. Finally, we present both qualitative and quantitative experimental results, demonstrating that the resulting particle filters deal efficiently and effectively with complicated target interactions.


Autonomous Robots | 1995

Communication in reactive multiagent robotic systems

Tucker R. Balch; Ronald C. Arkin

Multiple cooperating robots are able to complete many tasks more quickly and reliably than one robot alone. Communication between the robots can multiply their capabilities and effectiveness, but to what extent? In this research, the importance of communication in robotic societies is investigated through experiments on both simulated and real robots. Performance was measured for three different types of communication for three different tasks. The levels of communication are progressively more complex and potentially more expensive to implement. For some tasks, communication can significantly improve performance, but for others inter-agent communication is apparently unnecessary. In cases where communication helps, the lowest level of communication is almost as effective as the more complex type. The bulk of these results are derived from thousands of simulations run with randomly generated initial conditions. The simulation results help determine appropriate parameters for the reactive control system which was ported for tests on Denning mobile robots.


intelligent robots and systems | 2000

Fast and inexpensive color image segmentation for interactive robots

James Bruce; Tucker R. Balch; Manuela M. Veloso

Vision systems employing region segmentation by color are crucial in real-time mobile robot applications. With careful attention to algorithm efficiency, fast color image segmentation can be accomplished using commodity image capture and CPU hardware. This paper describes a system capable of tracking several hundred regions of up to 32 colors at 30 Hz on general purpose commodity hardware. The software system consists of: a novel implementation of a threshold classifier, a merging system to form regions through connected components, a separation and sorting system that gathers various region features, and a top down merging heuristic to approximate perceptual grouping. A key to the efficiency of our approach is a new method for accomplishing color space thresholding that enables a pixel to be classified into one or more, up to 32 colors, using only two logical AND operations. The algorithms and representations are described, as well as descriptions of three applications in which it has been used.


european conference on computer vision | 2004

An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets

Zia Khan; Tucker R. Balch; Frank Dellaert

We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or behavior of other targets. Such interactions cause problems for traditional approaches to the data association problem. In response, we developed a joint tracker that includes a more sophisticated motion model to maintain the identity of targets throughout an interaction, drastically reducing tracker failures. The paper presents two main contributions: (1) we show how a Markov random field (MRF) motion prior, built on the fly at each time step, can substantially improve tracking when targets interact, and (2) we show how this can be done efficiently using Markov chain Monte Carlo (MCMC) sampling. We prove that incorporating an MRF to model interactions is equivalent to adding an additional interaction factor to the importance weights in a joint particle filter. Since a joint particle filter suffers from exponential complexity in the number of tracked targets, we replace the traditional importance sampling step in the particle filter with an MCMC sampling step. The resulting filter deals efficiently and effectively with complicated interactions when targets approach each other. We present both qualitative and quantitative results to substantiate the claims made in the paper, including a large scale experiment on a video-sequence of over 10,000 frames in length.


Journal of Experimental and Theoretical Artificial Intelligence | 1997

AuRA: principles and practice in review

Ronald C. Arkin; Tucker R. Balch

This paper reviews key concepts of the Autonomous Robot Architecture (AuRA). Its structure, strengths, and roots in biology are presented. AuRA is a hybrid deliberative/ reactive robotic architecture that has been developed and refined over the past decade. In this article, particular focus is placed on the reactive behavioural component of this hybrid architecture. Various real world robots that have been implemented using this architectural paradigm are discussed, including a case study of a multiagent robotic team that competed and won the 1994 AAAI Mobile Robot Competition.


Archive | 2002

Robot Teams: From Diversity to Polymorphism

Tucker R. Balch; Lynne E. Parker

This is a comprehensive volume on robot teams that will be the standard reference on multi-robot systems. The volume provides not only the essentials of multi-agent robotics theory but also descriptions of exemplary implemented systems demonstrating the key concepts of multi-robot research. Information is presented in a descriptive manner and augmented with detailed mathematical formulations, photos, diagrams, and source code examples.


computer vision and pattern recognition | 2004

A Rao-Blackwellized particle filter for EigenTracking

Zia Khan; Tucker R. Balch; Frank Dellaert

Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Blacks influential paper on EigenTracking, they were successfully applied in tracking. For noisy targets, optimization-based algorithms (including EigenTracking) often fail catastrophically after losing track. Particle filters have recently emerged as a robust method for tracking in the presence of multi-modal distributions. To use subspace representations in a particle filter, the number of samples increases exponentially as the state vector includes the subspace coefficients. We introduce an efficient method for using subspace representations in a particle filter by applying Rao-Blackwellization to integrate out the subspace coefficients in the state vector. Fewer samples are needed since part of the posterior over the state vector is analytically calculated. We use probabilistic principal component analysis to obtain analytically tractable integrals. We show experimental results in a scenario in which we track a target in clutter.


international conference on robotics and automation | 2001

Distributed sensor fusion for object position estimation by multi-robot systems

Ashley W. Stroupe; Martin C. Martin; Tucker R. Balch

We present a method for representing, communicating and fusing distributed, noisy and uncertain observations of an object by multiple robots. The approach relies on re-parameterization of the canonical two-dimensional Gaussian distribution that corresponds more naturally to the observation space of a robot. The approach enables two or more observers to achieve greater effective sensor coverage of the environment and improved accuracy in object position estimation. We demonstrate empirically that, when using our approach, more observers achieve more accurate estimations of an objects position. The method is tested in three application areas, including object location, object tracking, and ball position estimation for robotic soccer. Quantitative evaluations of the technique in use on mobile robots are provided.


international conference on robotics and automation | 1993

Communication of behavorial state in multi-agent retrieval tasks

Ronald C. Arkin; Tucker R. Balch; Elizabeth Nitz

The impact on performance of a society of robots in a foraging task when simple communication is introduced is assessed. Results are obtained comparing task achievement in the absence of inter-agent communication relative to performance given the minimal knowledge of the behavorial state of fellow agents. Simple communication can result in significant performance enhancement. More robots generally mean more efficient use of time, and an overall speedup of goal recovery. Upon inspection of the larger body of results, which give the percentage of timeouts per number of shots, it is apparent that there is greater tendency for timing out with fewer robots. The distance graphs indicate that by adding robots, independent of communication, the task can be accomplished faster.<<ETX>>

Collaboration


Dive into the Tucker R. Balch's collaboration.

Top Co-Authors

Avatar

Manuela M. Veloso

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Ronald C. Arkin

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Frank Dellaert

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Matthew Powers

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Sanem Sariel

Istanbul Technical University

View shared research outputs
Top Co-Authors

Avatar

Ashley W. Stroupe

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Keith J. O'Hara

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Zia Khan

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Daniel Walker

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Magnus Egerstedt

Georgia Institute of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge