Award Abstract # 2423131
Collaborative Research: Interaction-aware Planning and Control for Robotic Navigation in the Crowd

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: REGENTS OF THE UNIVERSITY OF CALIFORNIA, THE
Initial Amendment Date: April 3, 2024
Latest Amendment Date: April 3, 2024
Award Number: 2423131
Award Instrument: Standard Grant
Program Manager: Karl Wimmer
kwimmer@nsf.gov
 (703)292-2095
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: January 1, 2024
End Date: August 31, 2025 (Estimated)
Total Intended Award Amount: $445,603.00
Total Awarded Amount to Date: $352,111.00
Funds Obligated to Date: FY 2022 = $352,109.00
History of Investigator:
  • Negar Mehr (Principal Investigator)
    negar@berkeley.edu
Recipient Sponsored Research Office: University of California-Berkeley
1608 4TH ST STE 201
BERKELEY
CA  US  94710-1749
(510)643-3891
Sponsor Congressional District: 12
Primary Place of Performance: University of California-Berkeley
1608 4TH ST STE 201
BERKELEY
CA  US  94710-1749
Primary Place of Performance
Congressional District:
12
Unique Entity Identifier (UEI): GS3YEVSS12N6
Parent UEI:
NSF Program(s): FRR-Foundationl Rsrch Robotics
Primary Program Source: 01002223DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 6840, 7632, 7932
Program Element Code(s): 144Y00
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.041, 47.070

ABSTRACT

This project aims to enable robot navigation in crowded, dynamic environments such as urban streets and busy walkways. For example, consider several small ground delivery robots which must navigate to specific goal positions while avoiding multiple pedestrians. Currently, decision-making algorithms follow a "predict then plan" approach, in which robots predict the future motion of agents in a scene and subsequently plan avoidance maneuvers. In reality, however, each agent's current decision affects the future observations and decision problems faced by others. This coupling of optimal planning through time is naturally expressed in the formalism of dynamic game theory; unfortunately, however, practical and efficient solution methods for general dynamic games have long been elusive. This project develops theoretical and algorithmic techniques to address some of the underlying challenges, and will also support cross-institution mentoring of multiple PhD students, development of undergraduate course material, and outreach to local underrepresented communities.

The specific goals of this project are threefold. The first goal is algorithmic, and aims to construct new algorithms to find approximate equilibrium solutions in several common classes of dynamic games which model distinct modes of human-robot interaction. As these algorithms solve robotic navigation problems, they must also be amenable to embedded, onboard implementation. The second goal of this project addresses the "inverse" problem: optimal planning in a crowd depends upon foreknowledge of humans' objectives. Whereas existing techniques infer agents' objectives in isolation, this project aims to derive novel methods for the strategically-coupled setting. The third and final goal is to accelerate interaction-aware planning in multi-robot, crowd scenarios via computational parallelization and decentralization. The algorithms will be extensively evaluated with human subjects in the setting of crowd navigation, using quadcopters and ground mobile robots.

This project is supported by the cross-directorate Foundational Research in Robotics program, jointly managed and funded by the Directorates for Engineering (ENG) and Computer and Information Science and Engineering (CISE).

This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Clark, Emma and Ryu, Kanghyun and Mehr, Negar "Adaptive learning from demonstration in heterogeneous agents: Concurrent minimization and maximization of surprise in sparse reward environments" Learning for Dynamics and Control (L4DC) 2024 , 2024 Citation Details
Ryu, Kanghyun and Mehr, Negar "Integrating Predictive Motion Uncertainties with Distributionally Robust Risk-Aware Control for Safe Robot Navigation in Crowds" , 2024 https://doi.org/10.1109/ICRA57147.2024.10610404 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page