Patents by Inventor Laurent SOULIER

Laurent SOULIER has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method, computer program and system for controlling a movement of a moving agent within a networked environment
    Patent number: 10753755
    Abstract: A method controlling movement of an agent moving within an environment represented by a directed graph including vertices located at a border of an unknown portion of the environment, includes: guiding the moving agent via execution of at least one iteration of following successive operations: planning a path towards a destination vertex or border vertex, via a progressively increasing evaluation of a first heuristic of cost; controlling navigation of the agent towards the destination or border vertex returned by the planning; controlling an exploration in the unknown portion if the planning returns a border vertex as the destination. The planning includes, for each calculation of the first cost heuristic for a border vertex, calculation of a second heuristic of risk. The method provides, as the destination, the border vertex with lowest calculated heuristic risk evaluation as soon as the cost exceeds this heuristic risk evaluation before reaching the destination vertex.
    Type: Grant
    Filed: May 3, 2016
    Date of Patent: August 25, 2020
    Assignee: Commissariat a l'energie atomique et aux energies alternatives
    Inventors: Fabrice Mayran De Chamisso, Michael Aupetit, Laurent Soulier
  • METHOD, COMPUTER PROGRAM AND SYSTEM FOR CONTROLLING A MOVEMENT OF A MOVING AGENT WITHIN A NETWORKED ENVIRONMENT
    Publication number: 20180106628
    Abstract: A method controlling movement of an agent moving within an environment represented by a directed graph including vertices located at a border of an unknown portion of the environment, includes: guiding the moving agent via execution of at least one iteration of following successive operations: planning a path towards a destination vertex or border vertex, via a progressively increasing evaluation of a first heuristic of cost; controlling navigation of the agent towards the destination or border vertex returned by the planning; controlling an exploration in the unknown portion if the planning returns a border vertex as the destination. The planning includes, for each calculation of the first cost heuristic for a border vertex, calculation of a second heuristic of risk. The method provides, as the destination, the border vertex with lowest calculated heuristic risk evaluation as soon as the cost exceeds this heuristic risk evaluation before reaching the destination vertex.
    Type: Application
    Filed: May 3, 2016
    Publication date: April 19, 2018
    Applicant: Commissariat a l'energie atomique et aux energies alternatives
    Inventors: Fabrice MAYRAN DE CHAMISSO, Michael AUPETIT, Laurent SOULIER