{"id":88,"date":"2012-01-09T15:37:18","date_gmt":"2012-01-09T20:37:18","guid":{"rendered":"https:\/\/www.bu.edu\/codes\/?page_id=88"},"modified":"2023-06-18T22:58:30","modified_gmt":"2023-06-19T02:58:30","slug":"platforms","status":"publish","type":"page","link":"https:\/\/www.bu.edu\/codes\/platforms\/","title":{"rendered":""},"content":{"rendered":"<h3>Platforms<\/h3>\n<h4 style=\"text-align: left;\">Discrete Event and Hybrid Systems<\/h4>\n<p style=\"text-align: left;\"><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/IPA\/\">Infinitesimal Perturbation Analysis (IPA)<\/a>: Sensitivity estimation of mean system time of a GI\/G\/1 queue with respect to arrival and service rates.<\/p>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/HSSim\/\">Manufacturing System as a Hybrid System:<\/a> Use of the forward algorithm to find the optimal control effort for each job<\/p>\n<h4 style=\"text-align: left;\">Multi-Agent Systems<\/h4>\n<p style=\"text-align: left;\">Coverage control simulator:<\/p>\n<ul>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageBasicV1\/\">Mission spaces with obstacles<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageBasicV2\/\">With second-order agents under velocity and acceleration constraints<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageBasicV3\/\">With second-order agents under velocity and acceleration constraints with obstacles<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageBasicV4\/\">Centralized boosting functions to escape local optima<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageBoosting\/\">Distributed boosting functions to escape local optima<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageGreedy\/\">Greedy methods to initialize with performance bound guarantees<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/CoverageFinal\/\">Final version with all the features<\/a><\/li>\n<\/ul>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/PersistentMonitoring\/\"><span>Persistent Monitoring on Networks<\/span><\/a><a href=\"http:\/\/scc-lite.bu.edu\/~shiran27\/PersistentMonitoringV1\/\"><\/a><\/p>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/Consensus\/\">Distributed consensus on Networks<\/a><\/p>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/OptimalTeamComposition\/\">Optimal agent team selection for coverage<\/a><\/p>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/LorenzSystem\/\">Lorenz System<\/a><\/p>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/shiran27\/VanDerPoleOscillator\/\">Van-Der-Pole Oscillator<\/a><\/p>\n<h4 style=\"text-align: left;\">Smart City<\/h4>\n<ul>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/?p=1802&#038;preview=true\">Safe Optimal Merging<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/Coverage_ADHS\/\">Multi Agent Coverage Control Problem with Energy Constraint<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/2019\/05\/07\/smart-transportation-in-future-cities\/\">Dukietown Smart City<\/a><\/li>\n<li style=\"text-align: left;\"><a href=\"https:\/\/www.bu.edu\/codes\/platforms\/rule\/\">Robotic Urban-Like Environment (RULE)<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/research\/smart-cities\/smartparking\/\">Smart Parking<\/a><\/li>\n<li><a href=\"https:\/\/www.bu.edu\/codes\/platforms\/street-bump\/\">SmartBump<\/a><\/li>\n<\/ul>\n<h4 style=\"text-align: left;\">Data Analysis and Network Optimization<\/h4>\n<p><a href=\"https:\/\/www.bu.edu\/codes\/simulations\/traffic_downloader\/trafficRepresentation.html\">Traffic Data Downloader<\/a>: Using this website you can download traffic pattern data of the area displayed on the map, as well as the topological data of how the links are connected to each other and their attributes (length, latitude, longitude, etc.)<\/p>\n<p><a href=\"https:\/\/salomonw.github.io\/congestionmaps\/DynamicPage\/AM\/\">Congestion Maps<\/a>: Comparison of traffic congestion in the Eastern Massachusetts area between 2012 and 2015.<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Platforms Discrete Event and Hybrid Systems Infinitesimal Perturbation Analysis (IPA): Sensitivity estimation of mean system time of a GI\/G\/1 queue with respect to arrival and service rates. Manufacturing System as a Hybrid System: Use of the forward algorithm to find the optimal control effort for each job Multi-Agent Systems Coverage control simulator: Mission spaces with [&hellip;]<\/p>\n","protected":false},"author":4463,"featured_media":0,"parent":0,"menu_order":8,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/88"}],"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\/4463"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/comments?post=88"}],"version-history":[{"count":50,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/88\/revisions"}],"predecessor-version":[{"id":1812,"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/pages\/88\/revisions\/1812"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/codes\/wp-json\/wp\/v2\/media?parent=88"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}