ROBOTIC TASK PLANNING FOR COMPLEX TASK INSTRUCTIONS IN NATURAL LANGUAGE

    公开(公告)号:US20210232121A1

    公开(公告)日:2021-07-29

    申请号:US17007391

    申请日:2020-08-31

    IPC分类号: G05B19/4155 B25J9/16

    摘要: This disclosure provides systems and methods for robotic task planning when a complex task instruction is provided in natural language. Conventionally robotic task planning relies on a single task or multiple independent or serialized tasks in the task instruction. Alternatively, constraints on space of linguistic variations, ambiguity and complexity of the language may be imposed. In the present disclosure, firstly dependencies between multiple tasks are identified. The tasks are then ordered such that a dependent task is always scheduled for planning after a task it is dependent upon. Moreover, repeated tasks are masked. Thus, resolving task dependencies and ordering dependencies, a complex instruction with multiple interdependent tasks in natural language facilitates generation of a viable task execution plan. Systems and methods of the present disclosure finds application in human-robot interactions.

    METHODS AND SYSTEMS FOR ENABLING HUMAN-ROBOT INTERACTION TO RESOLVE TASK AMBIGUITY

    公开(公告)号:US20220148586A1

    公开(公告)日:2022-05-12

    申请号:US17161767

    申请日:2021-01-29

    摘要: The disclosure herein relates to methods and systems for enabling human-robot interaction (HRI) to resolve task ambiguity. Conventional techniques that initiates continuous dialogue with the human to ask a suitable question based on the observed scene until resolving the ambiguity are limited. The present disclosure use the concept of Talk-to-Resolve (TTR) which initiates a continuous dialogue with the user based on visual uncertainty analysis and by asking a suitable question that convey the veracity of the problem to the user and seek guidance until all the ambiguities are resolved. The suitable question is formulated based on the scene understanding and the argument spans present in the natural language instruction. The present disclosure asks questions in a natural way that not only ensures that the user can understand the type of confusion, the robot is facing; but also ensures minimal and relevant questioning to resolve the ambiguities.

    SYSTEM AND METHOD FOR ENABLING ROBOT TO PERCEIVE AND DETECT SOCIALLY INTERACTING GROUPS

    公开(公告)号:US20210406594A1

    公开(公告)日:2021-12-30

    申请号:US17138224

    申请日:2020-12-30

    IPC分类号: G06K9/62 G06T7/00 G06K9/66

    摘要: This disclosure relates to system and method for enabling a robot to perceive and detect socially interacting groups. Various known systems have limited accuracy due to prevalent rule-driven methods. In case of few data-driven learning methods, they lack datasets with varied conditions of light, occlusion, and backgrounds. The disclosed method and system detect the formation of a social group of people, or, f-formation in real-time in a given scene. The system also detects outliers in the process, i.e., people who are visible but not part of the interacting group. This plays a key role in correct f-formation detection in a real-life crowded environment. Additionally, when a collocated robot plans to join the group it has to detect a pose for itself along with detecting the formation. Thus, the system provides the approach angle for the robot, which can help it to determine the final pose in a socially acceptable manner.

    SYSTEMS AND METHODS FOR OPTIMIZING SCHEDULING OF NON-PREEMPTIVE TASKS IN MULTI-ROBOTIC ENVIRONMENT

    公开(公告)号:US20200262650A1

    公开(公告)日:2020-08-20

    申请号:US16792945

    申请日:2020-02-18

    IPC分类号: B65G1/137 G06Q10/06 G06Q10/08

    摘要: Systems and methods for optimizing scheduling of non-preemptive tasks in a multi-robot environment are provided. Traditional systems and methods cite scheduling of preemptive task(s) allocation but such scheduling techniques generally do not provide for an efficient scheduling in the multi-robot environment since tasks are preemptive. Additionally, critical parameters like deadline and performance loss are not considered. Embodiments of the present disclosure provide for optimizing the scheduling of non-preemptive tasks in the multi-robot environment by defining a plurality of tasks; merging the plurality of tasks; scheduling, by implementing an Online Minimum Performance Loss Scheduling (OMPLS) technique, initially, tasks with a higher performance loss value and then secondly, tasks that can be scheduled within their deadline and having a low performance loss value amongst the merged tasks; and finally minimizing, a performance loss value of a remaining subset of tasks that cannot be scheduled within a pre-defined deadline.

    SYSTEMS AND METHODS FOR SCHEDULING A SET OF NON-PREEMPTIVE TASKS IN A MULTI-ROBOT ENVIRONMENT

    公开(公告)号:US20200004588A1

    公开(公告)日:2020-01-02

    申请号:US16284991

    申请日:2019-02-25

    IPC分类号: G06F9/48 B25J9/16

    摘要: Systems and methods for scheduling non-preemptive tasks in a multi-robot environment is provided. Traditional systems and methods facilitating preemptive task(s) allocation in a multi-processor environment are not applicable in the multi-robot environment since tasks are preemptive. Additionally, critical parameters like deadline and performance loss are not considered. Embodiments of the present disclosure provide for scheduling of a set of non-preemptive tasks by partitioning, the set of non-preemptive tasks either as a set of schedulable tasks or as a set of non-schedulable tasks; sorting, by a scheduling technique, the set of non-preemptive tasks partitioned; determining, by the scheduling technique, a possibility of execution of each of the set of schedulable tasks; and scheduling the set of schedulable tasks and the set of non-schedulable tasks upon determining the possibility of execution of each of the set of schedulable tasks. The present disclosure focuses on performance loss minimization when deadline miss is unavoidable.