首页|New Robotics Findings from Kanazawa University Described (Optimizing Motion Para meters in Soft Robotic Hands Using Bayesian Optimization: Enhancing Cycle Time, Addressing Vibration, and Repeatability)
New Robotics Findings from Kanazawa University Described (Optimizing Motion Para meters in Soft Robotic Hands Using Bayesian Optimization: Enhancing Cycle Time, Addressing Vibration, and Repeatability)
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
By a News Reporter-Staff News Editor at Robotics & Machine Learning Daily News Daily News - Investigators publish new report on ro botics. According to news reporting out of Kanazawa, Japan, by NewsRx editors, r esearch stated, “This study proposes a novel motion optimization method for a ma nipulator equipped with a soft robotic hand for object transportation. The flexi bility of the soft robotic hand induces large vibrations.” Financial supporters for this research include Jsps Kakenhi. Our news correspondents obtained a quote from the research from Kanazawa Univers ity: “The manipulator must pause until the vibration converges, leading to an in crease in the cycle time. The robotic system also has issue with the low motion repeatability in the robotic hand, even under identical operational conditions. In this study, a method based on Bayesian algorithms is developed to optimize th e motion of a manipulator. The objective is to minimize the cycle time for objec t transportation tasks, while considering the challenges of vibration and low re peatability in soft robotic hand systems. The optimization is performed through an exploratory search using actual experiments. To achieve a low-cost and versat ile measurement system, this study proposes a method for deriving the cycle time , which is a key metric for optimization, based on the measurement results obtai ned using a web camera with standard specifications. The proposed optimization m ethod is evaluated through a comparison with existing optimization methods, incl uding the grid-search-based, conventional Bayesian optimization, particle swarm optimization, S. Lin’s heuristic algorithm, and sparrow search algorithm.”
NETL
NSTL
