18682452. MOVING APPARATUS, MOVING APPARATUS CONTROL METHOD, AND PROGRAM simplified abstract (Sony Group Corporation)

From WikiPatents
Revision as of 05:28, 18 October 2024 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

MOVING APPARATUS, MOVING APPARATUS CONTROL METHOD, AND PROGRAM

Organization Name

Sony Group Corporation

Inventor(s)

ATSUSHI Suzuki of TOKYO (JP)

MOVING APPARATUS, MOVING APPARATUS CONTROL METHOD, AND PROGRAM - A simplified explanation of the abstract

This abstract first appeared for US patent application 18682452 titled 'MOVING APPARATUS, MOVING APPARATUS CONTROL METHOD, AND PROGRAM

Simplified Explanation: The patent application describes an apparatus and method for efficiently determining the best path for a moving apparatus, such as a walking robot, to travel safely. The apparatus includes a path planning unit that calculates a path cost for different path candidates based on stability during travel.

  • The apparatus includes a path planning unit that determines the travel path for a moving apparatus.
  • A cost calculation algorithm is applied to calculate a path cost for each path candidate, with lower costs indicating more stable travel.
  • The path planning unit sets sampling points along the path and calculates costs based on differences in landing heights of the left and right legs at each point.
  • The path candidate with the lowest calculated path cost is determined to be the best travel path.

Key Features and Innovation:

  • Efficiently determines the best path for a moving apparatus to travel safely.
  • Utilizes a cost calculation algorithm to evaluate stability during travel.
  • Sets sampling points along the path to calculate costs based on leg landing heights.
  • Selects the path candidate with the lowest calculated cost as the best travel path.

Potential Applications: This technology can be applied in various fields such as robotics, autonomous vehicles, and navigation systems for safe and efficient path planning.

Problems Solved: This technology addresses the challenge of determining the safest and most stable path for a moving apparatus to travel, ensuring smooth and secure navigation.

Benefits:

  • Enhances safety and stability during travel for moving apparatus.
  • Improves efficiency in path planning for robots and autonomous vehicles.
  • Reduces the risk of accidents and ensures smooth navigation.

Commercial Applications: Title: "Efficient Path Planning Technology for Moving Apparatus" This technology can be utilized in industries such as robotics, autonomous vehicles, and logistics for optimized path planning, enhancing safety and efficiency in operations.

Prior Art: Researchers can explore prior art related to path planning algorithms, stability analysis in robotics, and navigation systems for moving apparatus to understand the existing technologies in this field.

Frequently Updated Research: Researchers are continually exploring advancements in path planning algorithms, stability analysis techniques, and navigation systems for moving apparatus to enhance safety and efficiency in various applications.

Questions about Efficient Path Planning Technology: 1. How does the cost calculation algorithm determine the stability of travel for a moving apparatus? 2. What are the potential implications of this technology in the field of autonomous vehicles?


Original Abstract Submitted

To provide an apparatus and a method that efficiently determines a best path on which a moving apparatus such as a walking robot can travel safely. The apparatus includes a path planning unit that determines a travel path of the moving apparatus such as a walking robot, and the path planning unit is configured to calculate a path cost for each of a plurality of path candidates by applying a cost calculation algorithm in which a path that enables more stable traveling has a lower cost and to determine the path candidate having the path cost that has been calculated to be the lowest cost as the travel path that is best. The path planning unit sets a plurality of sampling points in a path, calculates a cost corresponding to each sampling point by applying the cost calculation algorithm in which the cost becomes higher as the difference between landing heights of the left and right legs at each sampling point becomes larger, and calculates an addition value of the costs of the sampling points as the path cost.