NP-completeness of optimal planning problem for modular robots
Crossref DOI link: https://doi.org/10.1007/s10514-019-09878-9
Published Online: 2019-07-25
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ye, Zipeng
Yu, Minjing
Liu, Yong-Jin http://orcid.org/0000-0001-5774-1916
Funding for this research was provided by:
the Natural Science Foundation of China (61725204, 61661130156)
Text and Data Mining valid from 2019-07-25
Version of Record valid from 2019-07-25
Article History
Received: 20 July 2018
Accepted: 18 July 2019
First Online: 25 July 2019