Stanford Robotics Seminar ENGR319 | Spring 2026 | Interactive Autonomy

The seminar provides a comprehensive and well-articulated overview of the challenges and solutions in interactive autonomy for robotics. Negar Mehr’s presentation is logically structured, starting with motivating examples, then formalizing the problem, and finally presenting her lab’s contributions. The use of game theory, specifically potential games, is a strong theoretical foundation that offers computational advantages, as demonstrated by the 20x speedup in solving for equilibria. The experimental validations on quadcopters and quadruped robots add credibility to the claims. However, the talk is primarily a high-level overview; some technical details are glossed over, and the audience is assumed to have a background in control theory and optimization. The speaker does not delve into the limitations of the potential game approach, such as scenarios where the assumptions of symmetry or potential structure may not hold. Additionally, while the talk mentions learning methods, it does not provide concrete results or comparisons. The sources cited are limited to the seminar schedule and general Stanford pages, but the speaker references her own published work without providing specific citations. Overall, the content is scientifically sound and valuable for researchers in robotics and multi-agent systems, but it could benefit from more depth and explicit references. The title accurately reflects the content, and the presentation quality is high.

The title accurately reflects the content: a seminar on interactive autonomy in robotics, covering multi-agent interaction, game-theoretic planning, and learning.

8/10

Presentation by a recognized academic (UC Berkeley professor) with clear theoretical foundations (game theory, potential games) and practical demonstrations. Claims are supported by references to published work, though not all details are provided. The talk is well-structured and technically sound.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 02:00Introduction to the problem of robots interacting in unstructured environments, with examples of failures.
• 05:00Explanation of the need for joint prediction and planning, and the concept of theory of mind.
• 10:00Formalization of multi-agent interactions as dynamic games and introduction of Nash equilibria.
• 15:00Discussion of the computational challenges in finding equilibria and the introduction of potential games.
• 20:00Demonstration of the potential game approach on quadcopters, with performance benchmarks.
• 30:00Extension to constrained problems, such as two robots transporting a rigid object.
• 40:00Overview of learning methods for interactive domains, including imitation and reinforcement learning.
• 50:00Discussion of safety and perception challenges in interactive autonomy.
• 1:00:00Conclusion and future research directions.

• Stanford Online Graduate Education — Mentioned as a resource for Stanford's graduate programs.
• Stanford Robotics Seminar Schedule — Provided as a link to follow along with the seminar schedule.

• Potential game - Wikipedia — Supports the theoretical foundation of potential games.
• Nash equilibrium - Wikipedia — Supports the game-theoretic solution concept.