{"id":1101,"date":"2019-03-29T17:57:20","date_gmt":"2019-03-29T21:57:20","guid":{"rendered":"https:\/\/www.bu.edu\/codes\/?p=1101"},"modified":"2019-03-29T18:00:40","modified_gmt":"2019-03-29T22:00:40","slug":"congratulations-to-dr-nan-zhou-on-his-successful-doctoral-thesis-defense","status":"publish","type":"post","link":"https:\/\/www.bu.edu\/codes\/2019\/03\/29\/congratulations-to-dr-nan-zhou-on-his-successful-doctoral-thesis-defense\/","title":{"rendered":"Congratulations to Dr. Nan Zhou on his successful Doctoral Thesis Defense."},"content":{"rendered":"

During his time at BU and at CODES Lab, Dr. Zhou\u2019s research focused on\u00a0robotic\u00a0motion planning, control, and optimization\u00a0with applications ranging from a single robotic\u00a0controller to large-scale interconnected autonomous vehicles. In particular, he used Dynamic Programming to uncover parametric policies for the Persistent Monitoring problem and Infinitesimal Perturbation Analysis to learn its optimal parameter. He tackled the persistent monitoring problem considering a single and multiple agents. To learn more about him, please go to his website<\/a>.<\/p>\n

Dr Zhou’s broad interests and joyful personality has made him an important part of the BU community. Not surprisingly, his dissertation defense was full of faculty and students from the department.<\/p>\n

\"\"<\/a>
Dr Zhou during the introduction of his defense.<\/figcaption><\/figure>\n

<\/p>\n

Below is the abstract from his dissertation defense:<\/p>\n

In persistent monitoring tasks, a group of cooperating mobile agents is used to monitor a dynamically changing environment that cannot be fully covered by stationary agents. The exploration process leads to the discovery of various points of interest to be perpetually monitored.<\/p>\n

First, using optimal control, the solution can be reduced to a simpler parametric form in one-dimensional and two-dimensional mission spaces with constrained agent mobility. The behavior of agents under optimal control is described by a hybrid system which can be analyzed using Infinitesimal Perturbation Analysis (IPA) to obtain an online solution. IPA allows the modeling of virtually arbitrary stochastic effects in target uncertainty and meanwhile its event-driven nature renders the solution scalable in the number of events rather than the state space.<\/p>\n

 <\/p>\n

\"\"<\/a>
Dr. Zhou explaining IPA-based gradient estimation during his Dissertation Defense.<\/figcaption><\/figure>\n

The second part of his work extends the previous by developing decentralized controllers which distribute functionality to the agents. Each agent then acts upon local information and sparse communication with neighbors. Conditions are identified under which the centralized solution can be exactly recovered in a decentralized event-driven manner based on local information\u2014 except for one event requiring communication from a non-neighbor agent. As we will saw during his dissertation, ignoring this non-local event only results in little loss of accuracy.<\/p>\n