A Multi-Agent Route Exploration Problem

Abstract

We investigate a route exploration problem with N agents dropped randomly on the interval [0,b] and discuss the impact of using multiple agents to perform this task. We consider both a discrete and a continuous description of the path to explore. Independently, we study an exploration problem with probabilistic agents having limited autonomy. In both problems , multi-agent scenarios are discussed with an emphasis on the number of agents necessary to obtain good performance.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 2005
Accession Number
AD1004472

Entities

People

  • Jerome L. Ny
  • Éric Féron

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Autonomy
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Autonomy
  • Boundaries
  • Brownian Motion
  • Differential Equations
  • Distribution Functions
  • Dynamic Programming
  • Equations
  • Feedback
  • Gaussian Noise
  • Inequalities
  • Order Statistics
  • Probability
  • Random Variables
  • Random Walk
  • Standards

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Computational Modeling and Simulation
  • Systems Analysis and Design