Enhancing Robot Social Navigation
with Reinforcement Learning
and Advanced Predictive Models

Student: Goodluck Oguzie
190212683@aston.ac.uk

Supervisor: Dr. Luis J. Manso
Associate-Supervisor: Prof. Dr. Aniko Ekart

๐Ÿ”Ž Presentation Outline

  1. Context, Motivation & Problem
  2. Reinforcement Learning Basics
  3. Predictive Models Overview
  4. Environments
  1. Key Contributions:
    • Predictive World Models
    • Cosine-Gated LSTM (CGLSTM)
    • Adaptive Prediction Horizons
  2. Conclusion & Future Work

๐Ÿค– What is Social Robot Navigation?

๐Ÿ’ก Definition:
Robots navigating among humans while respecting social norms, ensuring safety, and operating efficiently.

โœ”๏ธ Importance:
Social robot navigation is crucial for seamless integration into environments such as healthcare, hospitality, and public spaces. Advanced predictive decision-making is essential to manage inherent unpredictability.

Approach โœ… Strength โš ๏ธ Weakness
Rule Base (Arkin, 1998) Simple & efficient Fails in dynamic settings
Social Force Models (Helbing & Molnar, 1995) Good for crowd modeling Limited adaptability
RVO2 (Van den Berg et al., 2011) Real-time collision avoidance; effective in dynamic scenarios Limited in long-term planning and human comfort prediction
Reinforcement Learning (Mnih et al., 2015) Learns dynamically Requires extensive training

๐Ÿ’ก Our Research: Integrates reinforcement learning with advanced predictive models to overcome these limitations.

๐Ÿš€ The Problem:
"Robots struggle to navigate in social environments due to unpredictable human behavior."

Predict vs. React

๐Ÿ” Research Questions

โ“ Q1: How do predictive world models improve decision-making in Social Robot Navigation (SocNav)?

โ“ Q2: What challenges arise when transitioning Reinforcement Learning applications from discrete to continuous action spaces in Social Robot Navigation, and how can we address the challenges?

RL Fundamentals

RL Basics Diagram

๐Ÿ” Reinforcement Learning (RL) is a method by which an agent learns to make optimal decisions by taking actions in an environment to maximize cumulative reward (Sutton & Barto, 2018).

RL Algorithm ๐ŸŽฏ Strengths โš ๏ธ Limitations
DQN (Mnih et al., 2015) Efficient in discrete tasks Not suited for continuous or complex action spaces
DDPG (Lillicrap et al., 2015) Effective in continuous control tasks Sensitive to hyperparameters and exploration noise
PPO (Schulman et al., 2017) Stable learning; good sample efficiency Sensitive to hyperparameter tuning
TD3 (Fujimoto et al., 2018) Addresses overestimation bias in DDPG Still requires careful hyperparameter tuning
SAC (Haarnoja et al., 2018) Robust for continuous control; promotes exploration Higher computational demands
DreamerV3 (Hafner et al., 2023) Learns a latent world model for planning Sensitive to model inaccuracies and observation noise

Predictive Models

๐Ÿค Predictive Models are machine learning models that learn from sequential data to forecast future states.

Model Description ๐ŸŽฏ Pros โš ๏ธ Cons
RNN
(Rumelhart et al., 1986)
Basic recurrent net passing hidden states across time ๐ŸŽฏ Simple, good for short sequences โš ๏ธ Vanishing/exploding gradients for long sequences
LSTM
(Hochreiter & Schmidhuber, 1997)
Adds gating (input, forget, output) for long-term dependencies ๐ŸŽฏ Mitigates vanishing gradients; better for lengthy sequences โš ๏ธ More parameters, heavier computation
GRU
(Cho et al., 2014)
A simplified LSTM with fewer gates ๐ŸŽฏ Fewer parameters, faster training than LSTM โš ๏ธ May capture slightly less nuance for very long sequences
Transformers
(Vaswani et al., 2017)
Employ self-attention for global context ๐ŸŽฏ Excels at capturing long-range dependencies โš ๏ธ High memory & compute requirements

World Models (Ha & Schmidhuber, 2018)

World Models Diagram

Dreamer: A Step Forward, but Still Not Adaptive Enough

  • โœ… Builds on World Models
  • โš ๏ธ Does not consider all the possible actions
  • โš ๏ธ Fixed Prediction Horizon (one step ahead)
  • โฑ Limited Real-Time Prediction Horizon Adaptation

Environments Used

โš—๏ธ FallingBallEnv

๐Ÿ“Œ Purpose: Toy environment for sequence prediction.

๐Ÿช‚ LunarLanderโ€‘v2

๐Ÿ“Œ Purpose: A Simple Continuous control task for RL.

๐Ÿ™ SocNavGym

๐Ÿ“Œ Purpose: Benchmark for social navigation tasks.

๐Ÿท LiteSocNavGym

๐Ÿ“Œ Purpose: Lightweight variant for quicker iteration.

Predictive World Models for Social Navigation (Contribution 1)

  • The goal is to mitigate limitations of World Models:
  • ๐Ÿ”Ž single-step prediction
  • ๐Ÿ“Œ limited actions
  • ๐ŸŽฏ enabling multi-step, adaptive decision-making in dynamic social environments.

Paper PDF / Extended Explanation

๐Ÿงฉ 2StepAhead Predictive World Model

๐Ÿ” Predicts hidden & latent states two steps ahead.

๐ŸŽ› Multi Action State Predictive Model (MASPM)

๐Ÿ“Œ Predicts outcomes for all available actions.

๐Ÿ”— 2StepAhead-MASPM (Hybrid Model)

๐Ÿ”— Combines 2StepAheadโ€™s efficiency with MASPMโ€™s comprehensive evaluation.

โฑ Training Metrics

โฑ Full convergence reached in ~200k episodes with top rewards ~0.75.

๐ŸŽฏ Testing Metrics (1)

โœ… Testing results indicate higher rewards and success rates for our methods.

๐ŸŽฏ Testing Metrics (2)

๐ŸŽฏ 2StepAhead-MASPM demonstrates superior multi-metric performance.

Cosine-Gated LSTM (CGLSTM)

Contribution 2:

  • ๐Ÿค– Aims to improve sequence prediction by focusing on directional alignment.
  • ๐Ÿ“Œ Builds on limitations observed in previous LSTM experiments (e.g., in SocNavGym).

Paper PDF / Extended Explanation

๐Ÿ”Limitations

๐Ÿ“Œ They struggle with dynamic environments when predicting further ahead.

๐Ÿ’ก Why Cosine-Gated LSTM?

  • ๐Ÿค– Emphasizes directional alignment in sequence prediction.
  • ๐Ÿ“Œ Addresses the limitations of vanilla LSTM in handling long term prediction .

๐Ÿ—๏ธ CGLSTM Architecture

โš™๏ธ Dynamically weighs new inputs vs. hidden states based on similarities.

โฑ FallingBallEnv Results

๐Ÿ“Œ CGLSTM outperforms LSTM, GRU, and Transformer in the falling ball predictions.

๐Ÿ“Š Model Parameter Count

๐Ÿง  CGLSTM balances performance and efficiency with fewer parameters than the Transformer.

๐ŸŽฏ Benchmark Tasks (MNIST, etc.)

โœ… Highest accuracy overall.

โฒ๏ธ Training & Testing Times

๐Ÿ“Š GRU is faster, but CGLSTM uses ~5% more time for superior accuracy.

๐Ÿค– SocNavGym: Realistic Scenario

๐Ÿ“Œ Achieves the lowest MAE across prediction horizons (k=1 to k=10).

๐ŸŽฏ Multi-Model Prediction Comparison

๐ŸŽฏ CGLSTM shows tighter and more accurate trajectory predictions vs LSTM, GRU, and Transformer.

Entropyโ€Driven Adaptive Prediction Horizons

Contribution 3:

  • โœ… Propose an entropy-driven adaptive Prediction horizon within SAC.
  • ๐Ÿค– Integrate CGLSTM into DreamerV3 for enhanced predictive modeling.
  • ๐Ÿ“Š Benchmark vs. SAC, PPO, TD3, DDPG, DreamerV3 variants.

๐Ÿ”‘ Proposed Methods

  • ๐Ÿš€ DreamerV3 + CGLSTM
  • ๐Ÿ”— 2StepAhead-MASPM (Fixed Horizon)
  • ๐Ÿค– SAC + CGLSTM (Adaptive Prediction Horizon)

๐Ÿš€ Proposed: DreamerV3 + CGLSTM

๐Ÿค– Enhances State Prediction.

๐Ÿ”— Proposed: 2StepAhead-MASPM (Fixed Horizon)

โš™๏ธ Provides a strong baseline for adaptive Prediction horizon comparison.

๐Ÿค– Proposed: SAC + CGLSTM (Adaptive Prediction Horizon)

Dynamically adjusts prediction horizon via action entropy.

๐Ÿงช Preliminary Experiments Overview

  • โš™๏ธ Tested window-slide sizes: 16, 32, 64 for trade-offs in cost vs. accuracy.
  • ๐ŸŽฏ Compared horizon sets {1,2,3,4,5} vs. {1,2,4,6,8} vs. fixed 8-step horizon.

๐Ÿ“Š Window-Slide Selection

โœ… Slide=64 yields lowest training loss.

๐ŸŽฏ Adaptive Prediction Horizon Selection

๐ŸŽฏ Adaptive Prediction Horizon Selection Result.

๐Ÿ“Š Adaptive vs. Fixed Horizon

Adaptive {1,2,4,6,8} vs. fixed 8-step Prediction horizon.

โฑ Training Results: LunarLander

โฑ Full convergence reached in ~500k episodes.

โฑ Training Results: LiteSocNavGym

โฑ Full convergence reached in ~4 Million episodes.

๐Ÿ“Š LunarLander Results (1)

โš–๏ธ Success โ‰  Return: Models trade off landing quality, time, and efficiency.

๐Ÿ“Š LunarLander Results (2)

Note: Gaussian noise (ฯƒ = 0.085) added during testing.

๐Ÿ“Š Adaptive Prediction horizon SAC + CGLSTM achieves 175.22 average return.

๐Ÿ“Š LunarLander Results (3)

๐Ÿ“Š Highest weighted success for adaptive horizon: 99.73%.

๐Ÿ“Š LiteSocNavGym Results (3)

โš–๏ธ โœ… Not just reaching the goal โ€” how you get there matters.

๐Ÿ“Š LiteSocNavGym Results (1)

๐Ÿ“Š DreamerV3 + CGLSTM achieves 96% success.

๐Ÿ“Š LiteSocNavGym Results (2)

๐Ÿ“Š Adaptive horizon yields balanced success & cost.

โฑ Training Time per Model

โฑ DreamerV3 models take ~5โ€“10ร— longer to train.

๐Ÿ“ˆ Reward vs. Wall Clock

๐Ÿ“ˆ Steady improvement over time โ€” some models converge faster than others.

โš™๏ธ Inference Time vs. Return

โš–๏ธ High-performing models often require higher inference cost โ€” balance matters.

๐ŸŽ‰ Conclusion

  • ๐Ÿ” Novel Predictive Models: 2StepAhead, MASPM, and CGLSTM address short-horizon and reactive limitations in social robot navigation.
  • โœ… Enhanced Performance: Demonstrated higher safety, human comfort, and success rates in diverse simulation environments.
  • ๐Ÿš€ Adaptive Horizons in RL: Introduced an entropyโ€driven approach that surpasses fixed-horizon methods and enhances continuous-control capabilities.

๐Ÿš€ Future Work

Future Work Robot Platform

Deploy RL models on a real robot.

Publications Arising from this Thesis

  • ๐ŸŽฏ Oguzie, Goodluck, e Anikรณ Ekรกrt (2023). "Predictive World Models for Social Navigation." In: Advances in Computational Intelligence Systems, Contributi Presentati al 22ยฐ UK Workshop on Computational Intelligence (UKCI). Advances in Intelligent Systems and Computing (AISC). Springer. (In stampa)
  • ๐Ÿ” Oguzie, Goodluck. "Cosine-Gated LSTM." In: 2024 IEEE 5ยช Conferenza Internazionale su Pattern Recognition e Machine Learning (PRML), pp. 8โ€“15. IEEE, 2024.
  • ๐Ÿš€ Oguzie, Goodluck. "Adaptive Prediction Horizons in RL." (In Progress).

๐Ÿ“š References (1โ€“8)

  1. R. C. Arkin, Behavior-Based Robotics. MIT Press, 1998.
  2. D. Helbing and P. Molnar, โ€œSocial force model for pedestrian dynamics,โ€ Phys. Rev. E, vol. 51, no. 5, p. 4282, 1995.
  3. J. van den Berg, S. J. Guy, M. Lin, and D. Manocha, โ€œReciprocal n-body collision avoidance,โ€ in Robotics Research. Springer, 2011.
  4. V. Mnih, K. Kavukcuoglu, D. Silver, et al., โ€œPlaying Atari with deep reinforcement learning,โ€ arXiv preprint arXiv:1312.5602, 2013.
  5. R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, 2nd ed. MIT Press, 2018.
  6. T. P. Lillicrap, J. Hunt, A. Pritzel, et al., โ€œContinuous control with deep reinforcement learning,โ€ arXiv preprint arXiv:1509.02971, 2015.
  7. J. Schulman, F. Wolski, P. Dhariwal, et al., โ€œProximal policy optimization algorithms,โ€ arXiv preprint arXiv:1707.06347, 2017.
  8. S. Fujimoto, H. van Hoof, and D. Meger, โ€œAddressing function approximation error in actor-critic methods,โ€ in Proc. 35th Int. Conf. Machine Learning (ICML), 2018.

๐Ÿ“š References (9โ€“15)

  1. T. Haarnoja, A. Zhou, K. Hartikainen, et al., โ€œSoft actor-critic algorithms and applications,โ€ arXiv preprint arXiv:1812.05905, 2018.
  2. D. Hafner, T. Lillicrap, M. Norouzi, and J. Ba, โ€œMastering diverse domains through world models,โ€ arXiv preprint arXiv:2301.04104, 2023.
  3. D. E. Rumelhart, G. E. Hinton, and R. J. Williams, โ€œLearning representations by back-propagating errors,โ€ Nature, vol. 323, pp. 533โ€“536, 1986.
  4. S. Hochreiter and J. Schmidhuber, โ€œLong short-term memory,โ€ Neural Computation, vol. 9, no. 8, pp. 1735โ€“1780, 1997.
  5. K. Cho, B. van Merrienboer, D. Bahdanau, and Y. Bengio, โ€œOn the properties of neural machine translation: Encoder-decoder approaches,โ€ arXiv preprint arXiv:1409.1259, 2014.
  6. A. Vaswani, N. Shazeer, N. Parmar, et al., โ€œAttention is all you need,โ€ in Advances in Neural Information Processing Systems (NIPS), 2017.
  7. D. Ha and J. Schmidhuber, โ€œRecurrent world models facilitate policy evolution,โ€ in Advances in Neural Information Processing Systems (NIPS), 2018.

๐Ÿ™ Thank You

Questions?

https://goodluckoguzie.github.io/Viva