Optimal Cooperative Driving at Signal-Free Intersections with Polynomial-Time Complexity Article Swipe
Huaxin Pei
,
Yuxiao Zhang
,
Yi Zhang
,
Shuo Feng
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2104.13721
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2104.13721
Cooperative driving at signal-free intersections, which aims to improve driving safety and efficiency for connected and automated vehicles, has attracted increasing interest in recent years. However, existing cooperative driving strategies either suffer from computational complexity or cannot guarantee global optimality. To fill this research gap, this paper proposes an optimal and computationally efficient cooperative driving strategy with the polynomial-time complexity. By modeling the conflict relations among the vehicles, the solution space of the cooperative driving problem is completely represented by a newly designed small-size state space. Then, based on dynamic programming, the globally optimal solution can be searched inside the state space efficiently. It is proved that the proposed strategy can reduce the time complexity of computation from exponential to a small-degree polynomial. Simulation results further demonstrate that the proposed strategy can obtain the globally optimal solution within a limited computation time under various traffic demand settings.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2104.13721
- https://arxiv.org/pdf/2104.13721
- OA Status
- green
- Cited By
- 3
- References
- 30
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3159336323
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3159336323Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2104.13721Digital Object Identifier
- Title
-
Optimal Cooperative Driving at Signal-Free Intersections with Polynomial-Time ComplexityWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-04-28Full publication date if available
- Authors
-
Huaxin Pei, Yuxiao Zhang, Yi Zhang, Shuo FengList of authors in order
- Landing page
-
https://arxiv.org/abs/2104.13721Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2104.13721Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2104.13721Direct OA link when available
- Concepts
-
Computation, Computer science, Mathematical optimization, Time complexity, Computational complexity theory, Polynomial, Dynamic programming, State space, State (computer science), SIGNAL (programming language), Algorithm, Mathematics, Programming language, Mathematical analysis, StatisticsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
3Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 1, 2022: 1, 2021: 1Per-year citation counts (last 5 years)
- References (count)
-
30Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3159336323 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2104.13721 |
| ids.doi | https://doi.org/10.48550/arxiv.2104.13721 |
| ids.mag | 3159336323 |
| ids.openalex | https://openalex.org/W3159336323 |
| fwci | |
| type | preprint |
| title | Optimal Cooperative Driving at Signal-Free Intersections with Polynomial-Time Complexity |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10524 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2207 |
| topics[0].subfield.display_name | Control and Systems Engineering |
| topics[0].display_name | Traffic control and management |
| topics[1].id | https://openalex.org/T11099 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9990000128746033 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2203 |
| topics[1].subfield.display_name | Automotive Engineering |
| topics[1].display_name | Autonomous Vehicle Technology and Safety |
| topics[2].id | https://openalex.org/T10698 |
| topics[2].field.id | https://openalex.org/fields/33 |
| topics[2].field.display_name | Social Sciences |
| topics[2].score | 0.9979000091552734 |
| topics[2].domain.id | https://openalex.org/domains/2 |
| topics[2].domain.display_name | Social Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/3313 |
| topics[2].subfield.display_name | Transportation |
| topics[2].display_name | Transportation Planning and Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C45374587 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6727376580238342 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q12525525 |
| concepts[0].display_name | Computation |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6234196424484253 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.6210501790046692 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C311688 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6091046333312988 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q2393193 |
| concepts[3].display_name | Time complexity |
| concepts[4].id | https://openalex.org/C179799912 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5905914902687073 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q205084 |
| concepts[4].display_name | Computational complexity theory |
| concepts[5].id | https://openalex.org/C90119067 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5786471962928772 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q43260 |
| concepts[5].display_name | Polynomial |
| concepts[6].id | https://openalex.org/C37404715 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5487974882125854 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q380679 |
| concepts[6].display_name | Dynamic programming |
| concepts[7].id | https://openalex.org/C72434380 |
| concepts[7].level | 2 |
| concepts[7].score | 0.5144327282905579 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q230930 |
| concepts[7].display_name | State space |
| concepts[8].id | https://openalex.org/C48103436 |
| concepts[8].level | 2 |
| concepts[8].score | 0.47599852085113525 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q599031 |
| concepts[8].display_name | State (computer science) |
| concepts[9].id | https://openalex.org/C2779843651 |
| concepts[9].level | 2 |
| concepts[9].score | 0.47589075565338135 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q7390335 |
| concepts[9].display_name | SIGNAL (programming language) |
| concepts[10].id | https://openalex.org/C11413529 |
| concepts[10].level | 1 |
| concepts[10].score | 0.2731305658817291 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[10].display_name | Algorithm |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.2078080177307129 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C199360897 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[12].display_name | Programming language |
| concepts[13].id | https://openalex.org/C134306372 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[13].display_name | Mathematical analysis |
| concepts[14].id | https://openalex.org/C105795698 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[14].display_name | Statistics |
| keywords[0].id | https://openalex.org/keywords/computation |
| keywords[0].score | 0.6727376580238342 |
| keywords[0].display_name | Computation |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6234196424484253 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.6210501790046692 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/time-complexity |
| keywords[3].score | 0.6091046333312988 |
| keywords[3].display_name | Time complexity |
| keywords[4].id | https://openalex.org/keywords/computational-complexity-theory |
| keywords[4].score | 0.5905914902687073 |
| keywords[4].display_name | Computational complexity theory |
| keywords[5].id | https://openalex.org/keywords/polynomial |
| keywords[5].score | 0.5786471962928772 |
| keywords[5].display_name | Polynomial |
| keywords[6].id | https://openalex.org/keywords/dynamic-programming |
| keywords[6].score | 0.5487974882125854 |
| keywords[6].display_name | Dynamic programming |
| keywords[7].id | https://openalex.org/keywords/state-space |
| keywords[7].score | 0.5144327282905579 |
| keywords[7].display_name | State space |
| keywords[8].id | https://openalex.org/keywords/state |
| keywords[8].score | 0.47599852085113525 |
| keywords[8].display_name | State (computer science) |
| keywords[9].id | https://openalex.org/keywords/signal |
| keywords[9].score | 0.47589075565338135 |
| keywords[9].display_name | SIGNAL (programming language) |
| keywords[10].id | https://openalex.org/keywords/algorithm |
| keywords[10].score | 0.2731305658817291 |
| keywords[10].display_name | Algorithm |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.2078080177307129 |
| keywords[11].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2104.13721 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://arxiv.org/pdf/2104.13721 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2104.13721 |
| locations[1].id | doi:10.48550/arxiv.2104.13721 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2104.13721 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5067328517 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4815-2778 |
| authorships[0].author.display_name | Huaxin Pei |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I99065089 |
| authorships[0].affiliations[0].raw_affiliation_string | Tsinghua University |
| authorships[0].institutions[0].id | https://openalex.org/I99065089 |
| authorships[0].institutions[0].ror | https://ror.org/03cve4549 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I99065089 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Tsinghua University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Huaxin Pei |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Tsinghua University |
| authorships[1].author.id | https://openalex.org/A5030181618 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-7617-9279 |
| authorships[1].author.display_name | Yuxiao Zhang |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I99065089 |
| authorships[1].affiliations[0].raw_affiliation_string | Tsinghua University |
| authorships[1].institutions[0].id | https://openalex.org/I99065089 |
| authorships[1].institutions[0].ror | https://ror.org/03cve4549 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I99065089 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Tsinghua University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Yuxiao Zhang |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Tsinghua University |
| authorships[2].author.id | https://openalex.org/A5100653787 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-5526-866X |
| authorships[2].author.display_name | Yi Zhang |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I99065089 |
| authorships[2].affiliations[0].raw_affiliation_string | Tsinghua University |
| authorships[2].institutions[0].id | https://openalex.org/I99065089 |
| authorships[2].institutions[0].ror | https://ror.org/03cve4549 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I99065089 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Tsinghua University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Yi Zhang |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Tsinghua University |
| authorships[3].author.id | https://openalex.org/A5090727900 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-2117-4427 |
| authorships[3].author.display_name | Shuo Feng |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I27837315 |
| authorships[3].affiliations[0].raw_affiliation_string | †University of Michigan |
| authorships[3].institutions[0].id | https://openalex.org/I27837315 |
| authorships[3].institutions[0].ror | https://ror.org/00jmfr291 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I27837315 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | University of Michigan |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Shuo Feng |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | †University of Michigan |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2104.13721 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2021-05-10T00:00:00 |
| display_name | Optimal Cooperative Driving at Signal-Free Intersections with Polynomial-Time Complexity |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10524 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2207 |
| primary_topic.subfield.display_name | Control and Systems Engineering |
| primary_topic.display_name | Traffic control and management |
| related_works | https://openalex.org/W1932159282, https://openalex.org/W4312006216, https://openalex.org/W4286800113, https://openalex.org/W2078163775, https://openalex.org/W2922314686, https://openalex.org/W4377299729, https://openalex.org/W4285537323, https://openalex.org/W2148659013, https://openalex.org/W961142965, https://openalex.org/W1774334694 |
| cited_by_count | 3 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2022 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2021 |
| counts_by_year[2].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2104.13721 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2104.13721 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2104.13721 |
| primary_location.id | pmh:oai:arXiv.org:2104.13721 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://arxiv.org/pdf/2104.13721 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2104.13721 |
| publication_date | 2021-04-28 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W1979374731, https://openalex.org/W2921392100, https://openalex.org/W2809064993, https://openalex.org/W2613420336, https://openalex.org/W2980571877, https://openalex.org/W2525715571, https://openalex.org/W2950962171, https://openalex.org/W1997652242, https://openalex.org/W2509583637, https://openalex.org/W2793438216, https://openalex.org/W1571552128, https://openalex.org/W2921436962, https://openalex.org/W3011436878, https://openalex.org/W2026052947, https://openalex.org/W1577278402, https://openalex.org/W2772329503, https://openalex.org/W2799121082, https://openalex.org/W2763204767, https://openalex.org/W2099860849, https://openalex.org/W2964336994, https://openalex.org/W2963135764, https://openalex.org/W2137514195, https://openalex.org/W2508448572, https://openalex.org/W2011702401, https://openalex.org/W3086302379, https://openalex.org/W2284958039, https://openalex.org/W2962681260, https://openalex.org/W2146363089, https://openalex.org/W2976133733, https://openalex.org/W2964255588 |
| referenced_works_count | 30 |
| abstract_inverted_index.a | 80, 120, 138 |
| abstract_inverted_index.By | 60 |
| abstract_inverted_index.It | 103 |
| abstract_inverted_index.To | 40 |
| abstract_inverted_index.an | 48 |
| abstract_inverted_index.at | 2 |
| abstract_inverted_index.be | 96 |
| abstract_inverted_index.by | 79 |
| abstract_inverted_index.in | 22 |
| abstract_inverted_index.is | 76, 104 |
| abstract_inverted_index.of | 71, 115 |
| abstract_inverted_index.on | 88 |
| abstract_inverted_index.or | 35 |
| abstract_inverted_index.to | 7, 119 |
| abstract_inverted_index.and | 11, 15, 50 |
| abstract_inverted_index.can | 95, 110, 131 |
| abstract_inverted_index.for | 13 |
| abstract_inverted_index.has | 18 |
| abstract_inverted_index.the | 57, 62, 66, 68, 72, 91, 99, 107, 112, 128, 133 |
| abstract_inverted_index.aims | 6 |
| abstract_inverted_index.fill | 41 |
| abstract_inverted_index.from | 32, 117 |
| abstract_inverted_index.gap, | 44 |
| abstract_inverted_index.that | 106, 127 |
| abstract_inverted_index.this | 42, 45 |
| abstract_inverted_index.time | 113, 141 |
| abstract_inverted_index.with | 56 |
| abstract_inverted_index.Then, | 86 |
| abstract_inverted_index.among | 65 |
| abstract_inverted_index.based | 87 |
| abstract_inverted_index.newly | 81 |
| abstract_inverted_index.paper | 46 |
| abstract_inverted_index.space | 70, 101 |
| abstract_inverted_index.state | 84, 100 |
| abstract_inverted_index.under | 142 |
| abstract_inverted_index.which | 5 |
| abstract_inverted_index.cannot | 36 |
| abstract_inverted_index.demand | 145 |
| abstract_inverted_index.either | 30 |
| abstract_inverted_index.global | 38 |
| abstract_inverted_index.inside | 98 |
| abstract_inverted_index.obtain | 132 |
| abstract_inverted_index.proved | 105 |
| abstract_inverted_index.recent | 23 |
| abstract_inverted_index.reduce | 111 |
| abstract_inverted_index.safety | 10 |
| abstract_inverted_index.space. | 85 |
| abstract_inverted_index.suffer | 31 |
| abstract_inverted_index.within | 137 |
| abstract_inverted_index.years. | 24 |
| abstract_inverted_index.driving | 1, 9, 28, 54, 74 |
| abstract_inverted_index.dynamic | 89 |
| abstract_inverted_index.further | 125 |
| abstract_inverted_index.improve | 8 |
| abstract_inverted_index.limited | 139 |
| abstract_inverted_index.optimal | 49, 93, 135 |
| abstract_inverted_index.problem | 75 |
| abstract_inverted_index.results | 124 |
| abstract_inverted_index.traffic | 144 |
| abstract_inverted_index.various | 143 |
| abstract_inverted_index.However, | 25 |
| abstract_inverted_index.conflict | 63 |
| abstract_inverted_index.designed | 82 |
| abstract_inverted_index.existing | 26 |
| abstract_inverted_index.globally | 92, 134 |
| abstract_inverted_index.interest | 21 |
| abstract_inverted_index.modeling | 61 |
| abstract_inverted_index.proposed | 108, 129 |
| abstract_inverted_index.proposes | 47 |
| abstract_inverted_index.research | 43 |
| abstract_inverted_index.searched | 97 |
| abstract_inverted_index.solution | 69, 94, 136 |
| abstract_inverted_index.strategy | 55, 109, 130 |
| abstract_inverted_index.attracted | 19 |
| abstract_inverted_index.automated | 16 |
| abstract_inverted_index.connected | 14 |
| abstract_inverted_index.efficient | 52 |
| abstract_inverted_index.guarantee | 37 |
| abstract_inverted_index.relations | 64 |
| abstract_inverted_index.settings. | 146 |
| abstract_inverted_index.vehicles, | 17, 67 |
| abstract_inverted_index.Simulation | 123 |
| abstract_inverted_index.completely | 77 |
| abstract_inverted_index.complexity | 34, 114 |
| abstract_inverted_index.efficiency | 12 |
| abstract_inverted_index.increasing | 20 |
| abstract_inverted_index.small-size | 83 |
| abstract_inverted_index.strategies | 29 |
| abstract_inverted_index.Cooperative | 0 |
| abstract_inverted_index.complexity. | 59 |
| abstract_inverted_index.computation | 116, 140 |
| abstract_inverted_index.cooperative | 27, 53, 73 |
| abstract_inverted_index.demonstrate | 126 |
| abstract_inverted_index.exponential | 118 |
| abstract_inverted_index.optimality. | 39 |
| abstract_inverted_index.polynomial. | 122 |
| abstract_inverted_index.represented | 78 |
| abstract_inverted_index.signal-free | 3 |
| abstract_inverted_index.efficiently. | 102 |
| abstract_inverted_index.programming, | 90 |
| abstract_inverted_index.small-degree | 121 |
| abstract_inverted_index.computational | 33 |
| abstract_inverted_index.intersections, | 4 |
| abstract_inverted_index.computationally | 51 |
| abstract_inverted_index.polynomial-time | 58 |
| cited_by_percentile_year | |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile |