- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper draws on the established link between graph cellular automata and graph neural networks and proposes a graph neural network (GNN) and training procedure to learn a local transition rule for migrating a flock through a waypoint route. The GNN is adapted from [1, Grattarola] to use a mean aggregation to better support continuously changing agent neighborhoods. The paper uses the Boids algorithm, following [1, Grattarola], as an expert controller, but adds a new acceleration term to direct the flock along a series of waypoints. This expert is used in behavior cloning reinforcement learning to train the GNN to learn a local transition that implements the expert's control policy. The loss function has a custom weighting to emphasize how the control for transitioning the flock from moving toward one waypoint to the next. The GNN is evaluated using flocks of 100 agents and a routes of 5 waypoints, in 2 and 3 dimensions. For most of the test routes, the evaluation shows that the GNN successfully visits each waypoint while maintaining a compact, coherent flock, even when a significant number of agents are removed from the center of the flock.
[1, Grattarola] Daniele Grattarola, Lorenzo Livi, and Cesare Alippi. Learning graph cellular automata. In Advances in Neural Information Processing Systems, volume 34, pp. 20983–20994, 2021.
Critical strengths
- Strong performance of the method. The GNN controller completes most of the waypoint routes with flock compactness, directional alignment, and speed consistency metrics that meet or improve on the expert controller. The method appears to be an effective solution for the task.
Critical weaknesses
- Insufficient comparison with other approaches. The paper justifies comparing only with its expert controller because it is learning a cellular automaton (a local transition rule). There are other proposed methods for learning a local transition rule for flocking, in particular [2, Tolstaya], who learn a decentralized controller trained using [3, Tanner] as the expert (even though the expert is a centralized controller). While the proposed method appears effective, comparing with [2, Tolstaya] where the expert is modified with the same waypoint-seeking acceleration term would help illuminate why the proposed method is the best method.
- Dependence on a centralized decision for when a waypoint has been reached by the flock. Although this is a limitation stated in the paper, it means the learned transition is not local as claimed.
- Section 3.2 mixes background material with your methodology, and it is difficult to track all the components of your method. I suggest reorganizing this section.
[2, Tolstaya] Ekaterina Tolstaya, Fernando Gama, James Paulos, George Pappas, Vijay Kumar, and Alejandro Ribeiro. Learning decentralized controllers for robot swarms with graph neural networks. In Proceedings of the Conference on Robot Learning, volume 100 of Proceedings of Machine Learning Research, pp. 671–682, 2020.
[3, Tanner] H. G. Tanner, A. Jadbabaie, and G. J. Pappas. Stable flocking of mobile agents part ii: dynamic topology. In Decision and Control, 2003. Proceedings. 42nd IEEE Conference on, volume 2, pages 2016–2021. IEEE, 2003.
Questions for authors
- How does the decentralized controller learned in [2, Tolstaya] (where the expert [3, Tanner] has your proposed acceleration term) compare to your proposed method? Or, why is it not possible to compare [2, Tolstaya] for this task?
- Instead of using the flock's centroid to determine whether a waypoint has been reached by the flock, how does your method perform when agents decide that a waypoint has been reached using their neighborhood's centroid?