83 citations · 132 across the 8 of their papers we have counts for
Showing eess.SYShow all
2 papers · 1 filter
eess.SY2023
Signatures Meet Dynamic Programming: Generalizing Bellman Equations for Trajectory Following
Motoya Ohnishi, Iretiayo Akinola, Jie Xu +2
Path signatures have been proposed as a powerful representation of paths that efficiently captures the path's analytic and geometric characteristics, having useful algebraic proper…
eess.SY2019★ 13 cited
Constraint Learning for Control Tasks with Limited Duration Barrier Functions
Motoya Ohnishi, Gennaro Notomista, Masashi Sugiyama +1
When deploying autonomous agents in unstructured environments over sustained periods of time, adaptability and robustness oftentimes outweigh optimality as a primary consideration.…