{“状态”:“确定”,“消息类型”:“工作”,“信息版本”:“1.0.0”,“邮件”:{“索引”:{-“日期-部件”:[[2024,9,8]],“日期-时间”:“2024-09-08T00:26:57Z”,“时间戳”:1725755217198},“引用-计数”:18,“发布者”:“IEEE”,“许可证”:[{“开始”:{“日期-部分”:[2023,9,11]],”日期-时间“:“2023-09-11T00:00Z”,“timestamp”:1694390400000},“content-version”:“stm-asf”,“delay-in-days”:0,“URL”:“https:\/\/doi.org\/10.15223\/policy-029”},{“start”:{“date-parts”:[[2023,9,11]],“date-time”:“2023-09-11T00:00Z”,“timestamp”:1694390400000},“content-version”:“stm-asf”,“dellay-in-days”:0在“:{“domain”:[],“crossmark-restriction”:false},“short-container-title”:[]中,“published-print”:{“date-parts”:[[2023,9,11]]},“DOI”:“10.1109\/enc60556.2023.10508697”,“type”:“procesdings-article”,“created”:{“date-parts”:[[2024,4,30]],“date-time”:“2024-04-30T17:33:14Z”,“timestamp”:1714498394000},”page“1-8”,“source”:”Crossref“,”is-referenced-by-count“:0,”title“:[“探索机器人轨迹生成中遗传编程的最佳参数组合”],“前缀”:“10.1109”,“卷”:“13”,“作者”:[{“给定”:“纳尔逊”,“家族”:“蒙托亚”,“序列”:“第一”,“从属关系”:[}“名称”:“索诺拉理工学院(ITSON),墨西哥奥布雷贡市计算与设计系”}]},{“已知”:“辛西娅B.”,“家庭”:“Perez”,“sequence”:“additional”,“affiliation”:[{“name”:“Sonora Institute of Technology(ITSON),Unidad Guaymas,Ciudad Obregon,Mexico”}]},{“given”:“Luis A.”,“family”:“Castro”,“serquence”:“additionable”,“feliation”:[{”name“:”Sonora技术学院(ITSOR),计算与设计系,墨西哥奥布雷贡市}]},{”given“:”Eddie“,“faily”:“Clemente”,“sequence”:“additional”,“affiliation”:[{“name”:“Instituto Tecnológico de Ensenada,Ensenada,Mexico”}]}],“member”:“263”,“reference”:[{“key”:“ref1”,“doi asserted by”:“publisher”,“doi”:“10.1177\\0278364911406761”},{“key”:“ref2”,“doi asserted by”:“publisher”,“doi”:“10.1017\\CBO9780511546877”},{“key”:“ref3“,”doi断言“:”publisher“,“DOI”:“10.1007\/bf00175355”},{“key”:“ref4”,“DOI-asserted-by”:“publisher”,“DOI:”10.1016\/j.cnsns.2014.03.020“},}“key:”ref5“,”DOI-assert-by“:”publisher“,”DOI“:”10.1177\/0278364906065378 3.000051“},{“key”:“ref7”,“DOI-asserted-by”:“publisher”,“DOI”:“10.3390\/app12030943”},{“journal-title”:“arXiv-print arXiv:2209.01482.”,“article-title“:“一种用于复杂环境中机器人路径规划的基于知识的新型遗传算法”,“year”:“2022”,“author”:“Hu”,“key”:“ref8”},{“key“:”ref9“,”doi-asserted-by“:”publisher“,”doi“:”10.1109 \/access.2020.309399“},”{“密钥”:“ref10”,“doi-assert-by”:“publisher”,”doi-“”:“10.1109\/CCDC.2016.7531079”},{“key”:“ref11”,“doi-asserted-by”:“publisher”,“doi”:“10.1016\/j.eswa.2011.09.090”}0-01741-0“},{“首页”:“199”,“文章标题”:“非完整移动机器人的柔性路径规划”,“volume-title”:“Proc.4th European workshop on advanced mobile robots(EUROBOT01)”,“author”:“Graf”,“key”:“ref14”},{“key“:”ref15“,”doi-asserted-by“:”publisher“,”doi“:”10.1007\/978-3-540-87700-4_53“},”{“密钥”:“ref16”,“doi-assert-by”:“publisher”,“doi”:“10.1088\/1742-6596\/1881”/2\/022046“},{“key”:“ref17”,“doi-asserted-by”:“publisher”,“doi”:“10.1016\/j.jksuci.2020.10.010”},{“密钥”:“ref18”,“首页”:“2171”,“article-title”:“DEAP:进化算法变得容易”,“卷”:“13”,“作者”:“Fortin”,《年份》:“2012”,“期刊标题”:“机器学习研究杂志”}],“事件”:{“name”:“2023年墨西哥国际计算机科学会议(ENC)”,“start”:{“date-parts”:[[2023,9,11]]},“location”:“Guanajuato,Guanajuatato,Mexico”,“end”:{-“date-parts”:[[2023,9,13]]}},”container-title“:[”2023年墨西哥人计算机科学国际会议(ENC)“],”原文标题“:[],”链接“:[{”URL“:“http://\/xplorestaging.ieee.org\/ielx7\/10508598\/10508600\/10508797.pdf?arnumber=10508697”,“content-type”:“unspecified”,“content-version”:“vor”,“intended-application”:“similarity-checking”}],“deposed”:{“date-parts”:[2024,5,3]],“date-time”:”2024-05-03T18:26:31Z“,”timestamp“1714760791000},“score”:1,“resource”“:{”primary“:{”URL“:“https:\/\/ieeexplore.iee.org\/document\/10508697\/”}},“副标题”:[],“短标题”:[],“已发布”:{“日期部分”:[[2023,9,11]]},”引用计数“:18,”URL“:”http://\/dx.doi.org\/10.1009\/enc60556.2023.10508697 1]]}}