Jing-Sin Liu

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 Jin-Liang Chen

> Home > Persons > Jing-Sin Liu

Publications

2002
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/jirs/ChenLL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jirs/ChenLL02
Jin-Liang Chen, Jing-Sin Liu, Wan-Chi Lee:
A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments. J. Intell. Robotic Syst. 33(2): 209-230 (2002)
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/robotica/ChenLLL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/robotica/ChenLLL02
Jin-Liang Chen, Jing-Sin Liu, Wan-Chi Lee, Tzu-Chen Liang:
On-line multi-criteria based collision-free posture generation of redundant manipulator in constrained workspace. Robotica 20(6): 625-636 (2002)
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icarcv/ChenL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icarcv/ChenL02
Jin-Liang Chen, Jing-Sin Liu:
Avoidance of obstacles and joint limits for end-effector tracking in redundant manipulators. ICARCV 2002: 839-844
2001
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icra/ChenLL01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icra/ChenLL01
Jin-Liang Chen, Jing-Sin Liu, Wan-Chi Lee:
A Recursive Algorithm of Obstacles Clustering for Reducing Complexity of Collision Detection in 2D Environment. ICRA 2001: 3795-3800

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.