知识卡片

普通读书笔记卡 · 9190.a · 生成模型:GPT-6

高维离散规划面临状态数增长

理解等级:中级

每个独立维度取m个样本,联合网格可有m的d次方个状态。机械臂或双臂增加关节会迅速放大存储和碰撞检查;分别规划可降低单次规模,却可能漏掉需要协同避让的可行解。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      A* and D* become computationally expensive when either the search space is large (e.g., due to a fine resolution required for the task) or when the dimensions of the search problem are high (e.g., when planning for an arm with multiple degrees of freedom). Solutions to these problems can be provided by sampling-based path planning algorithms.

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第13章《路径规划》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_13.xhtml) - 结论依据:摘录中关于高维离散规划面临状态数增长的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:A* and D* become computationally expensive when either the search space is large (e.g., due to a fine resolution required for the task) or when the dimensions of the search problem are high (e.g., when planning for an arm with multiple degrees of freedom). Solutions to these problems can be provided by sampling-based path planning algorithms.