{"id":1478,"date":"2019-05-15T12:07:29","date_gmt":"2019-05-15T16:07:29","guid":{"rendered":"https:\/\/www.bu.edu\/codes\/?page_id=1478"},"modified":"2021-02-17T10:11:42","modified_gmt":"2021-02-17T15:11:42","slug":"smart-cities","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/codes\/research\/smart-cities\/","title":{"rendered":""},"content":{"rendered":"<div class=\"entry-content\" itemprop=\"text\">\n<div class=\"entry-content\">\n<h3>Smart Cities<\/h3>\n<p>As of 2014, 54% of the earth\u2019s population resides in urban areas, a percentage expected to reach 66% by 2050. This increase would amount to 2.5B people added to urban populations. At the same time, there are now 28 mega-cities (with \u001510M people) worldwide, accounting for 22% of the world\u2019s urban population, and projections indicate more than 41 mega-cities by 2030. It stands to reason that the management and sustainability of urban areas has become one of the most critical challenges our societies face today.<\/p>\n<p><strong>Read an <a href=\"http:\/\/people.bu.edu\/cgc\/Published\/ENG-16032-CGC.pdf\">Introductory Article about Smart Cities<\/a>\u00a0or <a href=\"https:\/\/christosgcassandras.org\/wp-content\/uploads\/2013\/07\/CDC2016plen.pdf\">presentation<\/a><\/strong><\/p>\n<div class=\"entry-content\">\n<p>There are several projects in our research group addressing issues in Smart Cities which we often view as an instance of a complex stochastic <a href=\"https:\/\/www.bu.edu\/codes\/cps\/\">Cyber-Physical System (CPS)<\/a>.<\/p>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Bike Sharing Systems<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>\nWe solved the problem of load balancing of bike stations assuming finite-capacity. We use Receding Horizon Control to optimally route a fleet of bike replenishment trucks over a planning horizon. The event-driven controller of this strategy decreases the complexity of finding optimal routes so that it may be used in real-time. Through simulation experiments, we found that a planning horizon of around 30 minutes is enough to be close to the full scheduling optimal solution.\n<\/ul>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Ride-Sharing Systems<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>The assignment of passengers to a fleet of vehicles in Ride Sharing System (RSS) is an exiting Combinatorial Problem. The problem involves a real-time optimization of assigning incoming passengers to vehicles as well as defining the routing strategy for each fleet\u2019s vehicle. As available information, it considers the origin-destination location of passengers and, the capacity and position of vehicles.  We tackle this problem using a Receding Horizon Control (RHC) strategy. This event-driven online model helps to reduce the complexity of the problem by defining a limited event-horizon to search.\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Traffic Congestion<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>Analyzing traffic data is becoming fundamental for making smarter decisions. Such data can be seen as enablers in making inferences, identifying traffic congestion bottlenecks, guiding individual driver routing decisions, and informing interventions by municipal and state authorities. The ultimate goal is to reduce congestion and its effects, including harmful emissions. We created Congestion Maps, a web-based inference engine for visualizing and analyzing congestion and travel times in the Eastern Massachusetts (EMA) road network.<br \/>\n<a href=\"https:\/\/salomonw.github.io\/congestionmaps\/DynamicPage\/AM\">See website<\/a>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Social Routing and the Price of Anarchy<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>\nWe study the problem of routing Connected and Automated Vehicles (CAVs) in the presence of mixed traffic (coexistence of regular vehicles and CAVs). In this setting, we assume that all CAVs belong to the same fleet, and can be routed using a centralized controller. The routing objective is to minimize a given overall fleet traveling cost (travel time or energy consumption). We assume that regular vehicles (non-CAVs) choose their routing decisions selfishly to minimize their traveling time. We propose an algorithm that deals with the routing interaction between CAVs and regular uncontrolled vehicles.<\/p>\n<p>The results suggest that collaborative routing decisions of CAVs improve not only the cost of CAVs, but also that of the non-CAVs. Furthermore, even a small CAV penetration rate can ease congestion for the entire network.\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Dukietown Smart Megacity Infrastructure<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>Powered by Linux, Docker, and ROS, our current Duckietown infrastructure (Mega-city environment) simulates traffic in a Smart City. Robots (cars) are controlled in order to run autonomously and to communicate with the transportation system (vehicle to vehicle, vehicle to infrastructure). Traffic lights are installed at selected intersections and its red\/green cycles can be remotely controlled using real-time traffic information of the system. The objective is to reduce the energy consumption of cars at intersections caused by unnecessary stops.<br \/>\n<a href=\"https:\/\/www.bu.edu\/codes\/2019\/05\/07\/smart-transportation-in-future-cities\/\">Read more<\/a><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Robotic Urban-Like Environment (RULE)<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>RULE is an experimental platform for automatic deployment of robotic cars in an urban-like environment. The cars are Khepera II and Khepera III miniature robots with processing, sensing, and communication capabilities. The \u201ccity\u201d has streets, intersections, traffic lights, and parking spots, and can be easily reconfigured. Four overhead cameras, serving as a GPS, are used to produce a topological map of the environment.<br \/>\n<a href=\"https:\/\/www.bu.edu\/codes\/platforms\/rule\/\">Read more<\/a>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Smart Parking<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>Studies have estimated that on a daily basis 30% of traffic in the downtown area of major cities is due to cruising for parking spots. In addition to aggravation and the waste of time and fuel for drivers looking for parking, this also contributes to the additional waste of time and fuel for other drivers as a result of traffic congestion.<br \/>\n<a href=\"https:\/\/www.bu.edu\/codes\/research\/smart-cities\/smartparking\/\">Read more<\/a>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Street Bump<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>Street Bump is a crowd-sourcing project belonging to the Smart City, which aims to help residents improve their neighborhood streets.<br \/>\n<a href=\"https:\/\/www.bu.edu\/codes\/platforms\/street-bump\/\">Read More<\/a>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"bu_collapsible_container\" aria-live=\"polite\" data-customize-animation=\"false\" style=\"overflow: hidden;\">\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 aria-expanded=\"false\" role=\"0\" tabindex=\"0\"><\/h4>\n<h4 class=\"bu_collapsible\" aria-expanded=\"false\" role=\"0\" style=\"cursor: pointer;\" tabindex=\"0\">Optimal Merging Control for CAVs<\/h4>\n<div class=\"bu_collapsible_section\" style=\"display: none;\">\n<ul>\n<li style=\"list-style-type: none;\">\n<ul> This research is about the optimal control of Connected and Automated Vehicles (CAVs) arriving from two curved roads at a merging point where the objective is to jointly minimize the travel time, energy consumption, and the passenger discomfort of each CAV. The solution guarantees that a speed-dependent safety constraint and a lateral rollover avoidance constraint are always satisfied, both at the merging point and everywhere within a control zone which precedes it. Read more <a href=\"https:\/\/www.bu.edu\/codes\/2021\/02\/17\/optimal-merging-control-for-cavs\/\">here<\/a>. <\/ul>\n<p><figure id=\"attachment1190\" aria-describedby=\"caption-attachment1190\" style=\"width: 360px\" class=\"wp-caption aligncenter\"><img loading=\"lazy\" src=\"\/codes\/files\/2021\/02\/merging_curve_heavy_vissim.gif\" alt=\"\" width=\"973\" height=\"535\" class=\"wp-image-1188 size-full\" \/><figcaption id=\"caption-attachment1190\" class=\"wp-caption-text\">Human driven vehicles at a merging scenario of the highway I-90 (known as The Massachusetts Turnpike), USA.<\/figcaption><\/figure><br \/>\n<figure id=\"attachment1189\" aria-describedby=\"caption-attachment1189\" style=\"width: 360px\" class=\"wp-caption aligncenter\"><img loading=\"lazy\" src=\"\/codes\/files\/2021\/02\/merging_curve_heavy_OCBF.gif\" alt=\"\" width=\"973\" height=\"535\" class=\"wp-image-1188 size-full\" \/><figcaption id=\"caption-attachment1189\" class=\"wp-caption-text\">CAVs with the joint optimal control and control barrier function method (Automatica: 123.109333, 2021).<\/figcaption><\/figure><\/p>\n<p>See more here<\/p>\n<\/li>\n<p><em><strong>Related Publications<\/strong><\/em><br \/>\nHuile Xu, Wei Xiao, Christos G Cassandras, Yi Zhang, Li Li. &#8220;A General Framework for Decentralized Safe Optimal Control of Connected and Automated Vehicles in Multi-Lane Intersections&#8221;. <i>Submitted to IEEE Transactions on Intelligent Transportation Systems<\/i><span>\u00a0(2019)<\/span>.<\/p>\n<p>Wei Xiao and Christos G. Cassandras. Decentralized optimal merging control for connected and automated vehicles with safety constraints guarantees. <i>Automatica, <\/i><span>\u00a0Volume 123, 109333, 2021<\/span>.<\/p>\n<\/ul>\n<\/div>\n<p>&nbsp;<\/p>\n<p><script type=\"text\/javascript\" src=\"http:\/\/www.bu.edu\/eng\/wp-content\/themes\/r-eng\/js\/script.min.js?ver=1.1.1\"><\/script><\/p>\n<p><script type=\"text\/javascript\" src=\"http:\/\/www.bu.edu\/eng\/wp-includes\/js\/wp-embed.min.js?ver=4.9.10\"><span data-mce-type=\"bookmark\" style=\"display: inline-block; width: 0px; overflow: hidden; line-height: 0;\" class=\"mce_SELRES_start\"><\/span><\/script><\/p>\n<p><script type=\"text\/javascript\" src=\"http:\/\/www.bu.edu\/eng\/wp-content\/plugins\/bu-front-end-library\/js\/collapsible.js?ver=4.9.10\"><\/script><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Smart Cities As of 2014, 54% of the earth\u2019s population resides in urban areas, a percentage expected to reach 66% by 2050. This increase would amount to 2.5B people added to urban populations. At the same time, there are now 28 mega-cities (with \u001510M people) worldwide, accounting for 22% of the world\u2019s urban population, and [&hellip;]<\/p>\n","protected":false},"author":15965,"featured_media":0,"parent":1174,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/1478"}],"collection":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/users\/15965"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/comments?post=1478"}],"version-history":[{"count":19,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/1478\/revisions"}],"predecessor-version":[{"id":1726,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/1478\/revisions\/1726"}],"up":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/1174"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/media?parent=1478"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}