ADAPTIVE Q LEARNING IN DYNAMICALLY CHANGING ENVIRONMENTS

    公开(公告)号:US20240311641A1

    公开(公告)日:2024-09-19

    申请号:US18602351

    申请日:2024-03-12

    摘要: Systems, methods, and computer-readable media for dynamic changes to both a learned control policy in the event of a change in the environment (e.g., introduction of a new or unseen obstacle). Rather than having to implement an entirely new policy (and a new global Q table), which can delay performance of tasks by agent(s), the present embodiments allow for a reduced delay in updating local Q table(s) based on detection of a new change in the environment. Locally changing the policy allows for more efficient updating of the policy based on changes in the environment, rather than globally changing the Q table after each change. Particularly in an event with multiple changes in the environment, the present embodiments increase efficiency in updating local and global Q tables while also reducing a delay in providing new instructions to the agent(s) in completing tasks.

    PLATOONING ASSISTANCE DEVICE, PLATOONING ASSISTANCE METHOD, AND PROGRAM

    公开(公告)号:US20240135345A1

    公开(公告)日:2024-04-25

    申请号:US18277222

    申请日:2022-03-21

    摘要: A platooning assistance device and a program with which it is possible to distribute the effect of platooning, and make payment. The platooning assistance device lets each of a plurality of vehicles forming a platoon have: a transaction data generation unit that generates platoon identification information identifying the platoon, vehicle identification information identifying the vehicle, and fuel consumption of the vehicle during platooning as transaction data; and a communication unit that transmits the generated transaction data to a network, and receives, from the network, data is the transaction data of each of the plurality of vehicles, and approved by a blockchain function. Any one of the plurality of vehicles has: a storage unit that stores smart contract data having a programmed, process for distributing the effect of platooning and making payment; and an execution unit that executes the process, on the basis of the approved data, in the blockchain.

    INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD, AND INFORMATION PROCESSING DEVICE

    公开(公告)号:US20240134390A1

    公开(公告)日:2024-04-25

    申请号:US18547361

    申请日:2022-01-19

    IPC分类号: G05D1/644 G05D1/243

    CPC分类号: G05D1/644 G05D1/2435

    摘要: An information processing system according to an embodiment of the present disclosure includes a first information processing device to be provided to a movable body and a second information processing device to be provided to a portion that differs from the movable body. The first information processing device includes a sensor portion, a generation portion, a control portion, and an integration portion. The sensor portion senses a first external environment. The generation portion uses sensor data acquired from the sensor portion to generate a first map. The control portion controls motion of a manipulator on the basis of the first map. The integration portion uses position information of inside the first external environment, with which portion the manipulator is in contact, integrates the first map and a second map acquired from the second information processing device with each other, and generates an integration map.

    MOVING APPARATUS, MOVING APPARATUS CONTROL METHOD, AND PROGRAM

    公开(公告)号:US20240345598A1

    公开(公告)日:2024-10-17

    申请号:US18682452

    申请日:2022-02-21

    发明人: ATSUSHI SUZUKI

    摘要: 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.