人工智能（路径寻优）

¥ 1000

¥ 1000 猿急送 Technology & Programming China
3 days ago

Description

3D打印对零件进行切片后，所得到的备切片层截面往往由n个封闭环构成，轮廓路径规划就是对封闭环进行逐个打印，在轮廓路径规划中，首先需要在每个封闭环确定一个打印点，在切片层共确定n个点。其次，与经典的旅行商问题(Travelling salesman problem TSP)相同，在确定的n个点中找到一条路径，每个点只被穿越一次。以该路径距离最短为目标，经过优化可有效减少每层打印所需的时间. 棋盘每格长宽相等，各为1单位，棋盘中共有n个封闭环，各封闭环边界上含有若干个整数顶点，需在每个封团环整数顶点中选取1个作为该封闭环起始点，在选取n个整数顶点后对n个顶点进行最短路径寻优，每个整数顶点需要且只

Go Now
关注公众号,不定期副业成功案例分享
Follow WeChat

Success story sharing

Want to stay one step ahead of the latest teleworks?

Subscribe Now

Similar Teleworks

HuntsBot,a one-stop outsourcing task, remote job, product ideas sharing and subscription platform, which supports DingTalk, Lark, WeCom, Email and Telegram robot subscription. The platform will push outsourcing task requirements, remote work opportunities, product ideas to every subscribed user with timely, stable and reliable.

简体中文 English

Platform

Support

Links

Contact US

Any questions or suggestions during use, you can contact us in the following ways:

Email: huntsbot@xinbeitime.com

Copyright© 2022-2023 www.huntsbot.com 浙ICP备2022000860号-4 All Rights Reserved.