-
1.
公开(公告)号:US20220114439A1
公开(公告)日:2022-04-14
申请号:US17129464
申请日:2020-12-21
Applicant: HERE Global B.V.
Inventor: Tero KESKI-VALKAMA
Abstract: An approach is provided for generating an asynchronous learning rules and/or architectures. The approach involves, for example, configuring an asynchronous machine learning agent to learn based on machine learning tasks. The asynchronous machine learning agent includes agent inputs for inputting task inputs of the machine learning tasks, agent outputs for outputting task outputs of the machine learning tasks, task feedback signals for scoring a performance on the one or more machine learning tasks, and a stateful neural units that are arbitrarily connected. The approach also comprises initiating a training of the asynchronous machine learning agent to learn an agent architecture, an agent learning rule, or a combination thereof based on the machine learning tasks. The approach further comprises configuring the stateful neural units based on the agent architecture, the agent learning rule, or a combination thereof to perform a subsequent machine learning task.
-
公开(公告)号:US20230137263A1
公开(公告)日:2023-05-04
申请号:US17452822
申请日:2021-10-29
Applicant: HERE GLOBAL B.V.
Inventor: Tero KESKI-VALKAMA , David JONIETZ , Huzefa CALCUTTAWALA
Abstract: A method, apparatus and computer program product are provided for generating structured trajectories based on probe data for simulating traffic flow. Methods include: receiving a plurality of sequences of probe data points; identifying splitting points in each of the plurality of sequences representing points where a respective sequence is split and decomposed into a plurality of legs; identifying the plurality of legs between pairs of splitting points; grouping legs according to a hierarchical optimizer into bunches of legs; determining, from the bunches of legs, a map representation of a road network; composing bunches of legs into a directed graph based on leg continuations, where the directed graph is formed by bunches of legs connected to continuation bunches of legs, and graph nodes of the directed graph represent intersection decision points; and simulating a condition including traffic flow within the road network based on decisions made at the intersection decision points.
-
公开(公告)号:US20230135578A1
公开(公告)日:2023-05-04
申请号:US17452821
申请日:2021-10-29
Applicant: HERE GLOBAL B.V.
Inventor: Tero KESKI-VALKAMA , David JONIETZ , Huzefa CALCUTTAWALA
IPC: G06F30/18 , H04W12/02 , G08G1/0969 , B60W60/00
Abstract: A method, apparatus and computer program product are provided for generating structured trajectories based on probe data while maintaining privacy and user information, and generating a map representation of a road network from the structured trajectories. Methods may include: receiving a plurality of trajectories of probe data points from a plurality of probe apparatuses; identifying splitting points in each of the plurality of trajectories of probe data points; identifying legs of the plurality of trajectories of probe data points between pairs of splitting points; assigning legs into bunches of legs; searching a solution space determined by leg bunch assignments; determining, from the bunches of legs, a selected solution representing a map of a road network; and facilitating at least one of navigational assistance or at least semi-autonomous vehicle control using the map of the road network.
-
公开(公告)号:US20230132499A1
公开(公告)日:2023-05-04
申请号:US17452820
申请日:2021-10-29
Applicant: HERE GLOBAL B.V.
Inventor: Tero KESKI-VALKAMA , David JONIETZ , Huzefa CALCUTTAWALA
Abstract: A method, apparatus and computer program product are provided for generating structured trajectories based on probe data while maintaining privacy and user information. Methods may include: receiving a plurality of sequences of probe data points from a plurality of probe apparatuses; identifying splitting points in each of the plurality of sequences of probe data points; identifying legs of the plurality of sequences of probe data points between pairs of splitting points; grouping legs within a predefined degree of similarity into bunches of legs; performing a guided search of a solution space containing the bunches of legs by performing successive mutations on candidate solutions in the solution space to identify a solution satisfying a fitness metric threshold; and identifying, from the solution satisfying a fitness metric threshold, a road network.
-
-
-