METHODS AND SYSTEMS FOR GENERATING OPTIMAL COVERAGE PLAN TO PERFORM AGRICULTURAL ACTIVITIES

METHODS AND SYSTEMS FOR GENERATING OPTIMAL COVERAGE PLAN TO PERFORM AGRICULTURAL ACTIVITIES

The present disclosure relates to methods and systems for generating optimal coverage plan to perform agricultural activities by farm workers. The present disclosure determines optimal deployment plan considering the constraints such as limited human farm workers, complete agricultural activities wi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: PAPPULA, SRINIVASU, SARANGI, SANAT, CHOUDHURY, SWAGATAM BOSE
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
CALCULATING
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The present disclosure relates to methods and systems for generating optimal coverage plan to perform agricultural activities by farm workers. The present disclosure determines optimal deployment plan considering the constraints such as limited human farm workers, complete agricultural activities within given time frame, optimizing cost, and so on. The entire farm or the plot is divided to smaller units such as sub-plots and agricultural activities required for each sub-plot are identified. Then, the uniform clusters are formed from the sub-plots such that the given constraints are satisfied, using a uniform distribution algorithm. An optimal routing algorithm is employed to determine the optimal path for each uniform cluster. Lastly, the uniform clusters are assigned to the farm workers to perform the agricultural activities, and the deployment coverage daily plan is generated using the optimal path for each cluster, so that total traversing time to cover the sub-plots is minimized.