{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:54:47Z","timestamp":1762329287671,"version":"build-2065373602"},"reference-count":0,"publisher":"Agora University of Oradea","issue":"6","license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INT J COMPUT COMMUN, Int. J. Comput. Commun. Control"],"abstract":"<jats:p>In urban areas, traffic mainly depends on decisions made by drivers, especially at junctions. The advent of Connected and Automated Vehicles aims to prevent driver error susceptible to causing accidents or congestion. This problem becomes more challenging when the intersection is signal-free. Numerous solutions have addressed this question, also called the conflict-free scheduling problem. However, most of them do not consider handling simultaneously spillbacks, vehicle heterogeneity, and prioritization. Besides, some of these contributions are limited only to pedestrians and ignoring other vulnerable road users such as cyclists and motorcyclists. These shortcomings are detrimental to any real-world efficient implementation. This paper aims to cope with these issues concurrently. To this end, we formulate this question as a Conflict-free and Precedence-Constrained Multiple Knapsack Problem (CPCMKP) solved through a distributed heuristic. Simulation results showed that this solution outperforms related state-of-the-art schemes concerning delay and fairness.<\/jats:p>","DOI":"10.15837\/ijccc.2025.6.6677","type":"journal-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:20:05Z","timestamp":1762327205000},"source":"Crossref","is-referenced-by-count":0,"title":["Decentralized Right-of-Way Protocol for Connected and Automated Vehicles at Unsignalized Intersections"],"prefix":"10.15837","volume":"20","author":[{"given":"Gokou Herv\u00e9 Fabrice","family":"Di\u00e9di\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris St\u00e9phane","family":"Zoun\u00e9m\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tchimou","family":"N\u2019Takp\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6528","published-online":{"date-parts":[[2025,11,5]]},"container-title":["INTERNATIONAL JOURNAL OF COMPUTERS  COMMUNICATIONS &amp; CONTROL"],"original-title":[],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:20:06Z","timestamp":1762327206000},"score":1,"resource":{"primary":{"URL":"https:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/view\/6677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"references-count":0,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,11,5]]}},"URL":"https:\/\/doi.org\/10.15837\/ijccc.2025.6.6677","relation":{},"ISSN":["1841-9844","1841-9836"],"issn-type":[{"value":"1841-9844","type":"electronic"},{"value":"1841-9836","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11,5]]}}}