Incentive Stackelberg game-based path planning for payload transportation with two quadrotors Online publication date: Mon, 23-Mar-2020
by Yaser Alothman; Wenzhong Zha; Dongbing Gu
International Journal of Modelling, Identification and Control (IJMIC), Vol. 33, No. 3, 2019
Abstract: This paper proposes a path planning approach to the task of transporting a cable-suspended payload with two quadrotors. The transporting system is provided with a desired payload path which is predefined by the user without the consideration of system dynamics. The path planning problem is to find the optimal paths for the quadrotors, which can make the payload move along the closest path to the desired one under the constraint of system dynamics. This problem is formulated as an incentive dynamic Stackelberg game where one quadrotor plays a leader role while the other plays a follower role. By using an incentive strategy, a game solution can be found based on the linearised dynamic system. Some simulation results are provided to show the performance of the proposed path planning approach. The planned paths are also used in real experiments where the paths are tracked by two quadrotors using PID controllers.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook