Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Kevin M. Lynch

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Daniel J. Lynch

> Home > Persons > Kevin M. Lynch

Publications

2023
[i9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2311-18685
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2311-18685
Daniel J. Lynch, Jason L. Pusey, Sean W. Gart, Paul B. Umbanhowar, Kevin M. Lynch:
Efficient, Responsive, and Robust Hopping on Deformable Terrain. CoRR abs/2311.18685 (2023)
2020
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/ral/LynchLU20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ral/LynchLU20
Daniel J. Lynch, Kevin M. Lynch, Paul B. Umbanhowar:
The Soft-Landing Problem: Minimizing Energy Loss by a Legged Robot Impacting Yielding Terrain. IEEE Robotics Autom. Lett. 5(2): 3658-3665 (2020)
2019
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1909-05790
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-05790
Daniel J. Lynch, Kevin M. Lynch, Paul B. Umbanhowar:
The Soft Landing Problem: Minimizing Energy Loss by a Legged Robot Impacting Yielding Terrain. CoRR abs/1909.05790 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.