Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Daokui Qu

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 Mingmin Liu

> Home > Persons > Daokui Qu

Publications

2022
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/LiuQXDJL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/LiuQXDJL22
Hongyan Liu, Daokui Qu, Fang Xu, Zhenjun Du, Kai Jia, Mingmin Liu:
An Efficient Online Trajectory Generation Method Based on Kinodynamic Path Search and Trajectory Optimization for Human-Robot Interaction Safety. Entropy 24(5): 653 (2022)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jirs/LiuQXDJSL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jirs/LiuQXDJSL22
Hongyan Liu, Daokui Qu, Fang Xu, Zhenjun Du, Kai Jia, Jilai Song, Mingmin Liu:
Real-Time and Efficient Collision Avoidance Planning Approach for Safe Human-Robot Interaction. J. Intell. Robotic Syst. 105(4): 93 (2022)
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/rcar/LiuQXDJL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rcar/LiuQXDJL22
Hongyan Liu, Daokui Qu, Fang Xu, Zhenjun Du, Kai Jia, Mingmin Liu:
Collision-Free Motion Planning Method Based on Online Trajectory Generation in High Dimensional Dynamic Workspace. RCAR 2022: 93-98

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.