Elibrary Perpustakaan Universitas Riau

Ebook, artikel jurnal dan artikel ilmiah

  • Beranda
  • Informasi
  • Berita
  • Bantuan
  • Pustakawan
  • Area Anggota
  • Pilih Bahasa :
    Bahasa Arab Bahasa Bengal Bahasa Brazil Portugis Bahasa Inggris Bahasa Spanyol Bahasa Jerman Bahasa Indonesia Bahasa Jepang Bahasa Melayu Bahasa Persia Bahasa Rusia Bahasa Thailand Bahasa Turki Bahasa Urdu

Pencarian berdasarkan :

SEMUA Pengarang Subjek ISBN/ISSN Pencarian Spesifik

Pencarian terakhir:

{{tmpObj[k].text}}
No image available for this title
Penanda Bagikan

e-journal

Ray-Shooting Algorithms for Robotics

Yu Zheng - Nama Orang; Katsu Yamane - Nama Orang;

Ray shooting is a well-studied problem in computer graphics and also has applications in robotics such as collision detection and contact force optimization. Unfortunately, most ray-shooting algorithms developed for graphics applications only allow 3-dimensional (3-D) objects represented as triangle meshes, and therefore are not suited for objects with parametric surfaces or general convex sets in high-dimensional space which robotics applications often require. In contact force optimization, for example, the problem is in the 6-dimensional (6-D) wrench space and it is desirable to consider the nonlinear friction cone without approximating it by a pyramid. This paper discusses existing and novel geometry-based ray-shooting algorithms applicable to general convex sets, and compares their performances in two
robotics applications: computing the distance between two convex objects and optimizing contact forces in grasping. Note to Practitioners—We describe efficient and accurate algorithms for ray-shooting problem, i.e., finding the intersection between a ray (a line emanating from a point) and a convex object.
Its major applications in robotics include computation of the distance between two convex objects and optimization of contact forces for multifingered grasping and multilegged locomotion.
The algorithms are efficient because they employ geometry-based iterations instead of general-purpose numerical optimization such as the active-set algorithm in MATLAB. They are accurate because we do not have to apply polygon approximation to object shapes in distance computation or to friction cones in contact force optimization. In distance computation, for example, this fact means that we can directly use the parametric representation of the object surfaces such as NURBS.
Index Terms—Collision detection, contact force optimization, distance measure, ray shooting, support function.


Ketersediaan

Tidak ada salinan data

Informasi Detail
Judul Seri
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
No. Panggil
-
Penerbit
New York : Graduate School of Economics, Waseda University., 2013
Deskripsi Fisik
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 10, NO. 4, OCTOBER 2013
Bahasa
English
ISBN/ISSN
1545-5955
Klasifikasi
-
Tipe Isi
-
Tipe Media
-
Tipe Pembawa
-
Edisi
VOL. 10, NO. 4, OCTOBER 2013
Subjek
TEKNIK
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Yuli/Agus
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
  • FULL TEXT. Ray-Shooting Algorithms for Robotics
Komentar

Anda harus masuk sebelum memberikan komentar

Elibrary Perpustakaan Universitas Riau
  • Informasi
  • Layanan
  • Pustakawan
  • Area Anggota

Tentang Kami

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Cari

masukkan satu atau lebih kata kunci dari judul, pengarang, atau subjek

Donasi untuk SLiMS Kontribusi untuk SLiMS?

© 2025 — Senayan Developer Community

Ditenagai oleh SLiMS
Pilih subjek yang menarik bagi Anda
  • Karya Umum
  • Filsafat
  • Agama
  • Ilmu-ilmu Sosial
  • Bahasa
  • Ilmu-ilmu Murni
  • Ilmu-ilmu Terapan
  • Kesenian, Hiburan, dan Olahraga
  • Kesusastraan
  • Geografi dan Sejarah
Icons made by Freepik from www.flaticon.com
Pencarian Spesifik
Kemana ingin Anda bagikan?