-
公开(公告)号：US11599958B2
公开(公告)日：2023-03-07
申请号：US17464986
申请日：2021-09-02
发明人： Adi Botea , Elizabeth Daly , Akihiro Kishimoto
IPC分类号： G06F16/00 , G06Q50/14 , G06Q10/047
摘要： A method incrementally solves a current journey planning request from a user. The solving step performs a current search for at least one journey plan that satisfies the request by accessing a database storing journey planning information derived from results to a plurality of previous requests. The solving step stores, in the database, information discovered during the current search for responding to a subsequent request. The information discovered during the current search for responding to the request includes a reusable portion of a search graph, pairs of a state and a lower bound on a best arrival time and pairs of a state and an exact value for the arrival time. The lower bound is employed to increase an accuracy of a pre-computer heuristic function which guides the search based on state dominance in search spaces in which heuristic values are back propagated and stored in the database.
-
公开(公告)号：US11669757B2
公开(公告)日：2023-06-06
申请号：US16262464
申请日：2019-01-30
发明人： Adi Botea , Beat Buesser , Akihiro Kishimoto , Bei Chen
CPC分类号： G06N5/048 , G01R19/2513 , G01R21/133 , G06F30/20 , G06N20/00
摘要： Embodiments for detection of energy consumption anomalies in one or more energy consumption systems in a cloud computing environment by a processor. Energy consumption anomalies associated with a selected facility, a selected object, or a combination thereof may be detected and diagnosed according to feedback and simulation data generated from a scenario-based simulation operation.
-
公开(公告)号：US20210398228A1
公开(公告)日：2021-12-23
申请号：US17464986
申请日：2021-09-02
发明人： Adi Botea , Elizabeth Daly , Akihiro Kishimoto
摘要： A method incrementally solves a current journey planning request from a user. The solving step performs a current search for at least one journey plan that satisfies the request by accessing a database storing journey planning information derived from results to a plurality of previous requests. The solving step stores, in the database, information discovered during the current search for responding to a subsequent request. The information discovered during the current search for responding to the request includes a reusable portion of a search graph, pairs of a state and a lower bound on a best arrival time and pairs of a state and an exact value for the arrival time. The lower bound is employed to increase an accuracy of a pre-computer heuristic function which guides the search based on state dominance in search spaces in which heuristic values are back propagated and stored in the database.
-
公开(公告)号：US11275902B2
公开(公告)日：2022-03-15
申请号：US16659216
申请日：2019-10-21
发明人： Adi Botea , Oznur Alkan , Elizabeth Daly , Massimiliano Mattetti , Pablo Pedemonte , Abel Nicolas Valente , Inge Vejsbjerg
摘要： Various embodiments are provided for providing intelligent dialog re-elicitation in a dialog system in a computing environment by a processor. Information, provided during a dialog using the dialog system, may be detected that has been subsequently revised. One or more variables impacted by the revised information provided during the dialog may be dynamically re-elicited.
-
公开(公告)号：US20170060903A1
公开(公告)日：2017-03-02
申请号：US14841620
申请日：2015-08-31
发明人： Adi Botea , Elizabeth Daly , Akihiro Kishimoto
CPC分类号： G06Q50/14 , G06Q10/047
摘要： A method and system are provided. The method includes incrementally solving, by a processor-based journey plan incremental searcher, a current journey planning request from a user. The solving step includes performing a current search for at least one journey plan that satisfies the current journey planning request by accessing a database storing journey planning information derived from results to a plurality of previous journey planning requests. The solving step further includes storing, in the database, at least part of the information discovered during the current search for responding to a subsequent journey planning request. The solving step also includes providing the at least one journey plan to the user.
摘要翻译： 提供了一种方法和系统。 该方法包括通过基于处理器的旅程计划增量搜索器逐步地解决来自用户的当前行程规划请求。 解决步骤包括通过访问存储从结果导出到多个先前旅程规划请求的行程规划信息的数据库来执行满足当前旅程规划请求的至少一个行程计划的当前搜索。 解决步骤还包括在数据库中存储在当前搜索期间发现的响应于随后的行驶规划请求的信息的至少一部分。 解决步骤还包括向用户提供至少一个旅程计划。
-
公开(公告)号：US11514458B2
公开(公告)日：2022-11-29
申请号：US16601445
申请日：2019-10-14
发明人： Bei Chen , Adi Botea , Elizabeth Daly , Oznur Alkan , Inge Vejsbjerg , Massimiliano Mattetti
摘要： Embodiments for implementing intelligent automation of opportunity transaction workflows by a processor. One or more tasks identified in an existing transaction opportunity workflow suitable for automation may be automated in a current transaction opportunity workflow. The automated tasks may be scheduled and executed in the current transaction opportunity workflow. The automated tasks in the current transaction opportunity workflow may be monitored.
-
公开(公告)号：US11287272B2
公开(公告)日：2022-03-29
申请号：US16194773
申请日：2018-11-19
发明人： Sean McKenna , Adi Botea
摘要： A system and method for combined route planning and opportunistic searching in variable costs environments are presented. A route for a vehicle may be dynamically planned according to an opportunistic search of an unknown domain to achieve one or more secondary objectives while both progressing towards a primary objective and minimizing travel costs using one or more Internet of Things (IoT) sensors and computing devices and a knowledge of a location of the vehicle relative to one or more waypoints.
-
公开(公告)号：US20170330134A1
公开(公告)日：2017-11-16
申请号：US15155763
申请日：2016-05-16
发明人： Adi Botea , Radu Marinescu
CPC分类号： G06Q10/083 , G05D1/0217 , G05D1/0278 , G05D1/0297 , G05D2201/0213 , G06Q10/06314 , G06Q10/30 , Y02W90/20
摘要： Automatically collecting bin content by receiving input data comprising geographic information, a set of constraints, a first set of status parameters corresponding to each of a plurality of service vehicles, and a second set of status parameters corresponding to each of a plurality of autonomous mobile bins. The input data is used to compute a first set of schedules for each of the plurality of service vehicles and a second set of schedules for each of the plurality of autonomous mobile bins. The first set of schedules and the second set of schedules together specify at least one meeting point at a meeting time between a service vehicle of the plurality of service vehicles and at least one bin of the plurality of autonomous mobile bins.
-
公开(公告)号：US11938969B2
公开(公告)日：2024-03-26
申请号：US16198935
申请日：2018-11-23
发明人： Adi Botea , Beat Buesser , Bei Chen , Akihiro Kishimoto
IPC分类号： G06Q50/30 , B60W60/00 , G06N5/01 , G06Q30/0283
CPC分类号： B60W60/0025 , G06N5/01 , G06Q30/0284 , G06Q50/30 , B60W2554/406 , G06Q2240/00
摘要： Embodiments for intelligent dynamic parking for autonomous vehicles by a processor. A dynamic parking plan may be determined for an autonomous vehicle to travel from a selected location and returning to the selected location within a selected time window according to a transportation network and one or more a variable parking functions in lieu of waiting at the selected location.
-
公开(公告)号：US11561964B2
公开(公告)日：2023-01-24
申请号：US16601438
申请日：2019-10-14
发明人： Adi Botea , Beat Buesser , Bei Chen , Akihiro Kishimoto
摘要： Embodiments for providing data content consumption support by a processor. Data from one or more data sources may be captured and received by one or more data capturing devices while a user is consuming the data on the one or more data sources. A domain knowledge may be automatically updated with the data. A response may be provided to one or more queries based upon information accessed from the knowledge domain.
-
-
-
-
-
-
-
-
-
搜索结果
14 条记录 (耗时 0.021 秒)
