Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Activity for matthewb‭

Type On... Excerpt Status Date
Edit Post #279772 Post edited:
Fixed silly math error
over 3 years ago
Comment Post #279772 @Lundin - I think applying greedy principles to my third idea above might be decent. I hope to code something up and try it out soon.
(more)
over 3 years ago
Comment Post #279772 This particular CNC program switches back and forth a lot between otherwise "earlier" and "later" tools to remove burrs, hence the inefficiency and interest in an algorithm. Once we have it, we'll probably apply it to other jobs as well.
(more)
over 3 years ago
Comment Post #279772 @Martin Bonner - actually, that is my application. I tried to generalize it, since I expect there might be applications in robotics and other related fields as well. We think we can shave several seconds off the cycle time, and when you're working on an automated cell that runs 24 hours a day with a ...
(more)
over 3 years ago
Comment Post #279776 Thanks! Those look helpful. I'll look into it more in the morning. The force-based method could be promising, though I'll have to think about how best to adapt it to my discrete situation.
(more)
over 3 years ago
Edit Post #279772 Initial revision over 3 years ago
Question How do I find the order that yields the shortest path?
The Problem I have a path optimization problem that in some ways reminds me of the Traveling Salesman Problem, but differs in some key respects. I have a group of items that need to be used by a machine in a certain sequence; for example, if I have (physical) objects A, B, C, and D, the machine ...
(more)
over 3 years ago