← Search

Daniel Lawson

5 accepted papers

2026

Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

ICLR 2026poster

While goal-conditioned behavior cloning (GCBC) methods can perform well on in-distribution training tasks, they do not necessarily generalize zero-shot to tasks that require conditioning on novel state-goal pairs, i.e. combinatorial generalization. In part, this limitation can be attributed to a lac…

Cited by 0Source ↗Scholar ↗
2025

Differentiable Composite Neural Signed Distance Fields for Robot Navigation in Dynamic Indoor Environments

ICRA 2025

Neural Signed Distance Fields (SDFs) provide a differentiable environment representation to readily obtain collision checks and well-defined gradients for robot navigation tasks. However, updating neural SDFs as the scene evolves entails re-training, which is tedious, time consuming, and inefficient

Cited by 6Source ↗code ↗Scholar ↗
2024

Co-learning Planning and Control Policies Constrained by Differentiable Logic Specifications

ICRA 2024poster

Synthesizing planning and control policies in robotics is a fundamental task, further complicated by factors such as complex logic specifications and high-dimensional robot dynamics. This paper presents a novel reinforcement learning approach to solving high-dimensional robot navigation tasks with c…

Cited by 1Source ↗Scholar ↗
2024

Merging Decision Transformers: Weight Averaging for Forming Multi-Task Policies

ICRA 2024poster

Recent work has shown the promise of creating generalist, transformer-based, models for language, vision, and sequential decision-making problems. To create such models, we generally require centralized training objectives, data, and compute. It is of interest if we can more flexibly create generali…

Cited by 11Source ↗code ↗Scholar ↗
2023

Control Transformer: Robot Navigation in Unknown Environments Through PRM-Guided Return-Conditioned Sequence Modeling

IROS 2023poster

Learning long-horizon tasks such as navigation has presented difficult challenges for successfully applying reinforcement learning to robotics. From another perspective, under known environments, sampling-based planning can robustly find collision-free paths in environments without learning. In this…

Cited by 12Source ↗Scholar ↗