-
Notifications
You must be signed in to change notification settings - Fork 36
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Presubmission inquiry: A python package for complete coverage path planning #140
Comments
Hi @sanjeevrs2000 and welcome to pyOpenSci, thank you for making this presubmission inquiry. A package that implements coverage planning algorithms from robotics would be in scope, yes, particularly if it focuses on (1) implementations / replications of some broad set of algorithms and (2) convenient to use data formats. However, I am able to find at least two similar packages that look like they are already well developed. I found these with a Google search for "coverage path planning python".
To be in scope and proceed with a review:
I don't mean to discourage you, and I am impressed by your initiative. But at first glance, this looks to me like a case where it might benefit your research community more if you were to contribute to those existing packages, instead of building another. Please let me know if that makes sense. I am happy to discuss here further. |
@NickleDave, thanks for the detailed response. Fields2cover does seem to be pretty well developed and documented. While it is similar to ours, our approach also considers obstacle regions and solves it by separating the region into sections and use of optimization to minimize distance. We believe ours also uses a convenient format (only latitude-longitude coordinates) that makes it easier to transfer to potential applications. Our work is an updated version of previously published work which has most of these described functionalities (https://journals.sagepub.com/doi/full/10.5772/56248). I do agree with your suggestions, but our initial intention was to make this existing work open source as we have been getting some requests for it. It is already packaged and released on PyPI, and we can update the documentation on github to be more detailed. Kindly let us know if you think this is sufficient to go into the review process, and if you have any other suggestions. |
Hi again @sanjeevrs2000, thank you for your patience. I will make a judgement call here and say that, yes, this submission is in scope. However, it will be a requirement for us to start the review that you (1) have complete documentation, as I will describe below, and (2) have the library installable from pip and/or conda (e.g. using conda-forge). There are other requirements I will link to below. These two items are crucial for you to do before you submit, so that it will pass the initial editor checks required to start the review:
There are other requirements but I wanted to call those two out based on my initial read-through of your repository. The rest of the requirements you will find here: These are not requirements, but strong suggestions:
Please let me know if all that is clear. If that makes sense to you, then confirm to me that you will submit when you have met those requirements, and I will then close this issue. |
Hi @NickleDave, thanks a lot again for your suggestions. So do I raise a new issue for submission when it is ready? |
Yes @sanjeevrs2000 please raise a new issue for the submission, and reference this one by number when you do. Thank you, looking forward to your submission! I'll go ahead and close this |
Submitting Author: Sanjeev Kumar (@sanjeevrs2000)
Package Name: cc_pathplanner
One-Line Description of Package: This repository contains a program which generates a guidance trajectory for complete 2D coverage. It can be used for operations where complete coverage of an Area of Interest (AoI) is required.
Repository Link (if existing): https://github.com/sanjeevrs2000/cpp
Description
This repository contains software to generate guidance trajectories that enable the robot to cover the specified region of interest using boustrophedon or lawn-mower motions. If the area of interest is large or if it has any forbidden regions or obstacles, it could be divided into smaller sections and covered one after the other. The order of visits to the sections is optimized using a travelling salesman problem (TSP) solver to minimize the overall distance. It also uses Dubins curves to generate continuous and feasible trajectories. The distance between the parallel tracks, and the driving angle, which is the fixed angle of the tracks, can be selected as per the requirements of the specific application.
Code of Conduct & Commitment to Maintain Package
Community Partnerships
We partner with communities to support peer review with an additional layer of
checks that satisfy community requirements. If your package fits into an
existing community please check below:
Scope
Scope
Please indicate which category or categories.
Check out our package scope page to learn more about our
scope. (If you are unsure of which category you fit, we suggest you make a pre-submission inquiry):
Domain Specific & Community Partnerships
We believe it comes under artificial intelligence and robotics. Unsure if it is within scope of PyOpenSci
It could be useful for researchers working in robotics and automation. It has potential applications like surveying, cleaning, mapping where coverage of a specific region of interest is required.
This package does have a sample program for coverage path planning. But it considers a grid based map which makes it harder to implement for several applications as additional preprocessing is required. Our work takes in latitude-longitude coordinates to generate realistic and feasible trajectories that are more suitable for real-world applications.
P.S. Have feedback/comments about our review process? Leave a comment here
The text was updated successfully, but these errors were encountered: