| Predicate |
Object |
| assignee |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_17f2c91d6073a10f992fe476cb411294 |
| classificationCPCAdditional |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05B2219-32328
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-02
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-86
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-285
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-60
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05B2219-31003
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D2201-0216
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-20
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y02P90-80 |
| classificationCPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D1-0027
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05B19-41895
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D1-0297
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D1-0274
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D1-0289
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05B19-418
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G05D1-0214
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/B25J9-1682 |
| classificationIPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G05B19-418
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G05D1-02 |
| filingDate |
2017-04-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate |
2020-05-05-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_da13960a14e507143bf44cd8b35c02e7 |
| publicationDate |
2020-05-05-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber |
US-10642282-B2 |
| titleOfInvention |
Roadmap annotation for deadlock-free multi-agent navigation |
| abstract |
Apparatus and methods related to routing robots are provided. A roadmap of an environment that includes first and second robots can be received. The roadmap can be annotated with unidirectional lanes connecting conflict regions, where each lane ends so to avoid blocking a conflict region. First and second routes for the respective uses of the first and second robots can be determined, where both the first and second routes include a first lane connected to a first conflict region. A first, higher priority and a second, lower priority can be assigned to the respective first and second robots. It can be determined that the second robot following the second route will block the first robot on the first lane. Based on the first priority being higher than the second priority, the computing device can alter the second route to prevent the second robot from blocking the first robot. |
| isCitedBy |
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-D950574-S
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-111708371-A |
| priorityDate |
2017-04-12-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type |
http://data.epo.org/linked-data/def/patent/Publication |