找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Climbing and Walking Robots; Proceedings of the 8 M. O. Tokhi,G. S. Virk,M. A. Hossain Conference proceedings 2006 Springer-Verlag Berlin H

[復(fù)制鏈接]
樓主: Espionage
31#
發(fā)表于 2025-3-27 00:00:52 | 只看該作者
32#
發(fā)表于 2025-3-27 04:23:09 | 只看該作者
https://doi.org/10.1007/978-3-031-18100-9 first problem is the interference of the umbilical cord for the robot with its mobility and dynamics; the second problem is the slow traveling speed of climbing robots, affecting the overall working efficiency of the system; the third one is unforeseen variations of surface curvature of objects on
33#
發(fā)表于 2025-3-27 07:56:32 | 只看該作者
34#
發(fā)表于 2025-3-27 12:55:02 | 只看該作者
http://image.papertrans.cn/c/image/227717.jpg
35#
發(fā)表于 2025-3-27 15:54:28 | 只看該作者
Recent Developments in Implantable and Surface Based Dropped Foot Functional Electrical Stimulatorshere remain limitations with the current clinically used technology and the paper describes some recent developments addressing some of these problems. The paper describes initial work on an alternative surface-based solution and recent developments of an implantable two channel stimulator.
36#
發(fā)表于 2025-3-27 20:34:03 | 只看該作者
37#
發(fā)表于 2025-3-28 00:22:19 | 只看該作者
Risk Analysis and Scientific MethodProper navigation of walking machines in unstructured terrain requires a path planning algorithm that reflects the flexibility of the robots movements. This paper discusses the problem and presents a real time capable path planning algorithm for walking machines that also makes use of their climbing abilities.
38#
發(fā)表于 2025-3-28 04:57:05 | 只看該作者
Navigation of Walking Robots: Path PlanningProper navigation of walking machines in unstructured terrain requires a path planning algorithm that reflects the flexibility of the robots movements. This paper discusses the problem and presents a real time capable path planning algorithm for walking machines that also makes use of their climbing abilities.
39#
發(fā)表于 2025-3-28 07:12:56 | 只看該作者
40#
發(fā)表于 2025-3-28 13:17:36 | 只看該作者
https://doi.org/10.1007/978-94-009-5241-6ved by a Genetic Algorithm. While we can get each maximum climb-able step height corresponding to the number of links, we can make clear the relation that the height of the climb-able step increases as the number of crawler links increases.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-24 19:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
和政县| 博罗县| 东乡族自治县| 清徐县| 聂荣县| 道真| 石景山区| 沧源| 汉中市| 舟山市| 汤阴县| 宜都市| 南陵县| 益阳市| 潜山县| 城步| 鞍山市| 新竹市| 永川市| 佳木斯市| 山阳县| 社旗县| 阿合奇县| 孟州市| 卓资县| 龙陵县| 开原市| 达孜县| 信宜市| 连山| 怀仁县| 沐川县| 曲周县| 林甸县| 江陵县| 获嘉县| 临朐县| 格尔木市| 南乐县| 夏邑县| 临海市|