Utafiti huu unalenga kupanga njia ya drone moja inayokusanya data kutoka moving wireless-sensor cluster heads kwa namna inayopunguza transmission energy inayotumiwa na sensors wakati wa mawasiliano. Wakati total distance ambayo drone inaweza kuruka ikiwekwa fixed, communication distance kati ya drone na kila moving cluster head inajaribiwa kupunguzwa. Watafiti walitatua problem hii kwa vector-field differential equation inayohifadhi route-length constraint na heuristic methods zinazotegemea traveling-salesman problem ambazo zinapanga upya visit order ya cluster heads.

Framework iliyopendekezwa inashughulikia problems mbili zinazohusiana. Problem ya kwanza ni kubaini ni points zipi drone inapaswa kupita kwa given visit order. Problem ya pili ni kubaini moving cluster heads zitembelewe kwa order gani ili kutoa lower communication cost. Kwa fixed order, negative objective gradient inaproyektiwa kwenye tangent plane ya route-length constraint; visit order inapangwa upya mara kwa mara kwa kutumia predicted sensor positions au optimized drone passage points.

Katika Monte Carlo simulations zilizofanywa katika six scenario classes, number of cluster heads, target speed relative to drone na allowed path length per cluster head zilibadilishwa. Kwa kila scenario na method, simulations 100 zilifanywa. Kulingana na watafiti, FinalXY na FinalUV zilitoa lowest transmission costs mara nyingi zaidi hasa katika larger na faster systems. Katika scenarios zenye moving cluster heads twenty, cost ya best solutions mara nyingi ilikuwa chini ya yüzde 10 ya cost katika initial fixed TSP ordering; katika scenarios zenye cluster heads 40 ilikuwa chini ya yüzde 5. Values hizi zinawakilisha relative reduction ya takriban zaidi ya yüzde 90 na yüzde 95 mtawalia.

Results hazitegemei physical energy measurement, bali simulation objective function inayochukulia cost kuwa proportional to square of distance kati ya drone na cluster head. Wind, obstacles, three-dimensional flight, packet loss, data-transfer duration, drone acceleration and turning constraints na position-estimation errors hazikumodeliwa. Kwa hiyo study haithibitishi kwamba same energy gain itapatikana katika real field au kwamba globally best route itapatikana katika all conditions.

Kwa mtazamo wa Uturuki: Method iliyopendekezwa inaweza kuadaptishwa kama research model nchini Uturuki kwa kukusanya data kutoka sensors zilizowekwa kwa moving livestock herds, monitoring large agricultural areas, forest na fire-risk observation, sensor networks zinazofanya kazi na moving agricultural machinery na hard-to-reach environmental monitoring regions. Kabla ya application, local terrain, wind, altitude, communication range, real sensor power curves, drone battery, obstacles na airspace conditions zinapaswa kuongezwa kwenye system. Algorithm inapaswa kulinganishwa katika field trials na real drones na sensor nodes; energy in joules, data-delivery ratio, mission duration na route-recalculation latency zipimwe. Kutokana na study hii haiwezi kuhitimishwa moja kwa moja kwamba nchini Uturuki kutapatikana yüzde 90–95 energy saving, regulatory compliance au real-time safe field operation.

Utafiti unatatua problem gani?

Wireless sensor networks katika remote au hard-to-access areas mara nyingi hutumia battery. Kutuma data moja kwa moja kutoka sensors hadi central station kunaweza kusababisha high energy consumption, hasa distance inapoongezeka. Katika study, drone moja hupita karibu na moving cluster heads zinazokusanya data za sensor groups na kufanya kazi kama mobile data receiver.

Drone kupita moja kwa moja juu ya kila cluster head kunaweza kupunguza communication distance ya sensors; lakini drone battery na mission duration vinaweka kikomo kwenye total route length. Kwa hiyo swali kuu ni hili: Ndani ya fixed total flight distance, drone inapaswa kutembelea moving cluster heads kwa order gani na kwa ukaribu gani ili total transmission cost ya cluster heads iwe ndogo iwezekanavyo?

Problem si geometric routing problem pekee. Kwa kuwa cluster heads zinatembea, arrival time ya drone kwenye target huamua position ya target wakati huo. Mabadiliko yoyote kwenye previous route segments hubadilisha arrival times kwa later targets na hivyo later communication distances pia.

System ilidesigniwaje?

Study inachukulia sensors zimepangwa katika clusters. Sensors katika kila cluster hutuma data zao kwa cluster head moja; drone huwasiliana si directly na sensors zote bali na moving cluster heads hizi. Figure 1 kwenye page 2 inaonyesha conceptually drone ikifuata multi-segment route inayopita karibu na moving targets na cluster heads zikituma data kwa drone. Figure ni system schematic iliyochukuliwa kutoka previous source; si simulation result.

Main assumptions za model ni hizi:

• Time-dependent two-dimensional positions za cluster heads zinajulikana mapema.
• Drone inachukuliwa kuwa constant-speed.
• Own energy consumption ya drone inawakilishwa tu na total flown distance.
• Maximum route length inayopatikana kwa drone ni fixed.
• Wakati data inapokelewa kutoka cluster head, drone position inachukuliwa kuwa approximately stationary.
• Transmission cost ni proportional to a power of distance kati ya drone na cluster head.

Assumption ya mwisho inawakilisha kwa simplified form distance-dependent power loss katika radio communication. Katika simulations, exponent p = 2 ilichaguliwa. Kwa hiyo objective function inakuwa sum of squared communication distances.

Positions za moving targets zinahesabiwaje?

Time-dependent position ya cluster head number j inaonyeshwa hivi:

\[ \bigl(X_j(t),Y_j(t)\bigr) \]

Passage point ambayo drone inapokea data kutoka cluster head hii inaelezwa kama:

\[ q_j=(u_j,v_j) \]

Drone huanza kutoka starting point \(q_0=(0,0)\) na katika simulations hurudi kwenye same point. Distance iliyosafiri kabla drone kufika passage point number j ni:

\[ g_{j-1}(\vec{u},\vec{v}) = \sum_{k=0}^{j-1}\ell_k \]

na length ya kila route segment ni:

\[ \ell_k= \sqrt{(u_k-u_{k+1})^2+(v_k-v_{k+1})^2} \]

Kwa drone speed \(s_d\), corresponding arrival time inahesabiwa kama:

\[ t_j=\frac{g_{j-1}(\vec{u},\vec{v})}{s_d} \]

Hivyo position ya cluster head wakati wa data transfer inakuwa:

\[ x_j=X_j(t_j), \qquad y_j=Y_j(t_j) \]

Kubadilisha passage point moja kunaweza kuathiri si communication distance katika point hiyo pekee, bali later arrival times na positions za later cluster heads pia.

Transmission-energy objective function iliundwaje?

Communication distance kati ya drone na cluster head number j imefafanuliwa kama:

\[ d_j= \sqrt{(x_j-u_j)^2+(y_j-v_j)^2} \]

Total transmission cost inawakilishwa na objective function hii:

\[ f(\vec{u},\vec{v}) = \sum_{j=1}^{J} \left[ (x_j-u_j)^2+(y_j-v_j)^2 \right]^{p/2} = \sum_{j=1}^{J}d_j^p \]

Hapa J ni number of cluster heads na p ni distance-dependent path-loss exponent. Real transmitter power, number of bits, channel coefficient au joule conversion coefficient hazikuongezwa kwenye model. Kwa hiyo f ni relative communication cost inayotumiwa kulinganisha methods zaidi kuliko real energy measurement.

Total drone route length imetolewa kama:

\[ g(\vec{u},\vec{v}) = \sum_{j=0}^{J}\ell_j \]

na constraint ifuatayo inatumika:

\[ g(\vec{u},\vec{v})\leq L \]

Hapa L ni maximum route length inayobainishwa na drone battery na mission conditions. Mathematical problem imeandikwa kama:

\[ \min_{\vec{u},\vec{v}} f(\vec{u},\vec{v}) \quad \text{koşuluyla} \quad g(\vec{u},\vec{v})\leq L \]

.

Vector-field method inahifadhije route length?

Direction inayopunguza objective function kwa kasi zaidi ni negative gradient \(-\nabla f\). Lakini kusogea directly katika direction hii kunaweza kubadilisha total route length. Watafiti wanaproject negative objective gradient kwenye tangent plane iliyo perpendicular to gradient ya route-length constraint.

Projected direction ni:

\[ -\nabla f+ \frac{\nabla f\cdot\nabla g} {\nabla g\cdot\nabla g}\nabla g \]

. Inner product ya direction hii na \(\nabla g\) ni zero. Kwa hiyo movement hutokea katika tangent direction ya route-length surface na equality \(g=L\) huhifadhiwa.

Kwa numerical solution, watafiti hutumia vector differential equation hii:

\[ \frac{d(\vec{u},\vec{v})}{d\tau} = -(\nabla g\cdot\nabla g)\nabla f + (\nabla f\cdot\nabla g)\nabla g \]

\(\tau\) hapa si real flight time ya drone. Ni artificial au pseudo-time inayoonyesha direction ambayo solution inasonga wakati wa optimization. Route length inahifadhiwa huku objective function ikipunguzwa.

Method inalenga kufikia local minimum karibu na given initial solution. Global best solution inaweza kupatikana tu ikiwa initial point iko katika suitable basin of attraction. Kwa hiyo watafiti walitumia additional ordering algorithms kuboresha initial order na passage points.

Initial route inaundwaje?

First visit order inatokana na traveling-salesman problem iliyosolveiwa kwenye positions za targets katika predicted time ambayo study inaita “mid-time”. Katika text, time hii imeelezwa kama \(t_m=L/s_d\). Kwa kuwa value hii chini ya constant-speed assumption ni sawa na total route duration, mathematical meaning ya term “mid-time” haijaelezwa vya kutosha.

Ikiwa tour length inayotembelea targets zote ni ndogo kuliko allowed L, drone data-collection points zinawekwa kwenye target positions. Ikiwa tour ni kubwa kuliko allowed length, internal route points zinascaleiwa along lines kati ya center ya start/end points na cluster heads. Scaling coefficient ni:

\[ k=\frac{L}{L_{\mathrm{tour}}} \]

na kwa hivyo initial route length inaleta kwenye allowed value.

Kwa nini visit order ni muhimu?

Kwa stationary targets, short TSP tour inaweza kutoa good initial solution. Kwa moving targets, location at arrival time ndiyo muhimu. Target inayoonekana close mwanzoni inaweza kuwa imeondoka mbali wakati drone inafika; target nyingine inayoonekana mbali inaweza kuwa imekaribia route. Kwa hiyo fixed order inayotegemea initial positions pekee inaweza kuunda large communication distances.

Study haisolve visit order moja kwa moja kwa single exact mathematical method. Badala yake inatumia hybrid framework inayobadilishana vector-field optimization kwa fixed order na order-changing methods.

FinalXY method inafanyaje kazi?

FinalXY kwanza huoptimize entire route kwa current visit order. Kisha arrival time ya drone kwa kila target inahesabiwa na predicted positions za cluster heads wakati huo zinabainishwa. New TSP inasolveiwa kwenye predicted target positions na global visit order inajengwa upya.

Ikiwa new order ni tofauti na previous order, route inaoptimizeiwa tena kwa kutumia previous solution kama initial guess. Process inaendelea mpaka previously seen ordering irudi, na lowest-cost solution iliyopatikana katika iterations zote inahifadhiwa.

Advantage ya method ni kwamba inaweza kurestructure entire visit sequence, si small part ya order pekee. Disadvantage ni kwamba repeated TSP solving inaweza kuongeza computational load.

FinalXY Greedy method ni nini?

FinalXY Greedy hutumia same iterative structure kama FinalXY, lakini badala ya kusolve exact TSP kwa new order hutumia nearest-neighbor greedy approach. Lengo ni kupunguza computational cost.

Simulation results zinaonyesha approach hii ni competitive hasa katika small systems zenye cluster heads ten. Target count, path length au target speed zinapoongezeka, FinalXY na FinalUV kwa ujumla zimezalisha lower cost.

FinalUV inatofautianaje?

FinalUV hutumia optimized drone passage points kwa reordering badala ya predicted final positions za moving targets. Kwa maneno mengine, new TSP inajengwa kwenye \((u_j,v_j)\) points ambazo drone hukusanya data katika current solution.

Katika baadhi ya scenarios, method ilitoa energy values karibu na FinalXY huku ikifanya fewer reorderings. Figure 10 kwenye page 21 inaonyesha FinalUV ilikuwa na moja ya lowest reordering counts katika scenarios mbalimbali.

Rolling-ordering methods zinafanyaje kazi?

Predicted Rolling husogea kutoka beginning ya route kwenda end; ikifika selected visit index, huhesabu predicted positions za targets ambazo bado hazijatembelewa wakati huo. New TSP order hupatikana kwa remaining targets na unfinished part ya route inaoptimizeiwa tena. Already processed visits zinawekwa fixed.

Greedy Rolling hutumia same structure, lakini inaorder remaining targets kwa nearest-neighbor approach badala ya exact TSP. Kwa kuwa methods hizi mbili hufanya local incremental changes, zinaweza kuwa faster kuliko global reorderings; lakini katika study results mara nyingi ziliunda self-crossing na higher-cost routes.

Kwa nini reverse-direction versions zilitathminiwa?

Forward na reverse directions za initial TSP tour zinaweza kuwa na same geometric length. Lakini kwa moving targets, orders hizi mbili hazitoi same arrival times wala same communication distances. Kwa hiyo kila moja ya five base methods iliendeshwa separately kwa forward na reverse initial order.

Watafiti waliripoti best solution inayopatikana wakati forward na reverse versions za same base method zinatathminiwa pamoja kama “combined method”. Approach hii inaonyesha kama kujaribu additional initial solution kunapunguza local-minimum dependence.

Simulation scenarios ziliundwaje?

Initial points za cluster heads ziliundwa kwa Halton quasi-random sequences ili kupunguza clustering na kusample area kwa balance zaidi. Points zilisambazwa kwenye circle ya radius 1 kilometer kuzunguka drone starting point.

Speed ya kila cluster head ilichaguliwa kutoka uniform distribution kati ya zero na defined maximum speed, na movement direction kutoka uniform angular distribution. Kulingana na code description, cluster heads husogea linearly kwa constant speed na constant direction. Drone start/end point ni \((0,0)\), na transmission-loss exponent ni \(p=2\).

Six scenarios zilidesigniwa kutathmini separately effects za target speed, number of cluster heads na allowed route length. Katika kila scenario, simulations 100 zilifanywa kwa kila method.

Energy distributions zinaonyesha nini?

Figure 2 kwenye page 13 inaonyesha distribution ya lowest objective value iliyopatikana among all methods katika kila simulation. Katika low-speed scenario, values nyingi zilikusanyika karibu na zero; katika high-speed scenario distribution ilisogea kwenye higher na wider values. Hii inaonyesha kwamba fast-moving targets hufanya finding suitable close-approach points kuwa harder kwa drone.

Katika short-path scenario, energy values ziliongezeka relative to baseline scenario. Available path kwa drone inapokuwa shorter, freedom to approach targets hupungua. Study text inasema effect hii ni limited zaidi kuliko effect ya increased target speed.

Katika large scenario yenye cluster heads forty, total objective values ziliripotiwa kuwa unexpectedly lower. Watafiti wanaripoti result hii lakini hawaelezi kwa detailed mechanism au normalization analysis kwa nini total energy value inaweza kushuka target count inapoongezeka.

Ni method gani ilitoa best result mara nyingi zaidi?

Figure 3 kwenye page 14 inaonyesha mara ngapi kila method ilitoa lowest cost peke yake au tied with other methods katika samples 100. Katika small system, FinalXY Greedy ilionyesha strong performance. Katika baseline, high-speed na large scenarios, FinalXY na reverse version yake zilikuwa among methods zinazotoa best solutions mara nyingi zaidi. FinalUV na reverse version yake zilifuatia karibu katika cases nyingi.

Figure 6 kwenye page 17 inaunganisha forward na reverse versions chini ya method moja. Katika baseline, high-speed na large systems, combined FinalXY inafikia clearly highest win count. Katika large system, FinalUV pia inaonekana strong second option.

Average transmission costs zilibadilikaje?

Figure 4 kwenye page 15 inaonyesha mean, standard deviation na yüzde 5–95 percentile range za energy objective values za methods. FinalXY na reverse version yake ziko among lowest means katika all six scenarios. FinalUV pia ilitoa results close to FinalXY hasa katika baseline, high-speed na large systems.

Rolling methods zina higher means na wider distributions katika baadhi ya scenarios. Hii inaonyesha kwamba same method haikuweza consistently kutoa low cost katika different initial layouts.

Figure 7 kwenye page 18 inaonyesha comparison ya combined forward/reverse results. Katika low speed, FinalUV, FinalXY Greedy na FinalXY ziko close, lakini target speed na system size zinapoongezeka advantage ya FinalXY inaonekana wazi zaidi.

Percentage improvements zilikuwa katika kiwango gani?

Katika study, improvement ratio inahesabiwa kutokana na difference kati ya initial TSP ordering na optimized solution:

\[ \text{İyileşme}(\%) = 100 \frac{E_{\mathrm{ilk}}-E_{\mathrm{son}}} {E_{\mathrm{ilk}}} \]

Figure 5 kwenye page 16 inaonyesha percentage-improvement distributions za methods separately. Katika baseline scenario, average improvements za FinalXY na FinalUV family ziko above yüzde 90. Katika large scenario, methods nyingi zinakaa katika yüzde 90–100 range.

Figure 8 kwenye page 19 inaonyesha combined forward/reverse results. Katika baseline scenario, FinalXY na FinalUV zinatoa improvements zinazokaribia yüzde 95; katika large scenario results zinakusanyika very close to yüzde 100. Hizi ni relative results zinazohesabiwa kutoka graph na initial objective value; si percentages zilizopimwa katika real sensor battery consumption.

Methods zilichukua muda gani?

Figure 9 kwenye page 20 inaonyesha runtimes kwenye logarithmic horizontal axis. Number of cluster heads, target speed na allowed path length zilipoongezeka, method runtime pia iliongezeka. Greedy methods kwa kawaida zilikuwa faster than FinalXY.

FinalUV, ingawa TSP-based, ilikamilika kwa similar au shorter time kuliko greedy methods katika baadhi ya scenarios. Watafiti wanaeleza hii kwa fewer reorderings katika FinalUV.

Simulations ziliendeshwa kwenye standard desktop computer yenye Intel Core i5-10400, 2,9 GHz processor na 12 GB RAM. Study inaripoti kwamba best routes za systems zenye cluster heads 40 zinaweza kuhesabiwa ndani ya seconds. Lakini duration hii ni algorithm desktop-processing time pekee; receiving sensor data, updating position, transfer to flight control na communication latencies hazijumuishwi.

Route visualizations zinaonyesha nini?

Figure 11 kwenye page 22 inalinganisha routes za all forward and reverse methods katika one selected baseline sample. FinalXY na FinalUV paths zinaform more regular polygons, huku Predicted Rolling na Greedy Rolling zikionyesha self-crossing route segments mara nyingi zaidi.

Watafiti wanaeleza kwamba kunaweza kuwa na relationship kati ya self-crossing paths na higher energy objective values. Hata hivyo, study haikupima relation hii kwa separate statistical test. Figure inaonyesha one selected example pekee na haiwakilishi peke yake geometric behavior ya all simulations.

Main conclusions zinazoungwa mkono na study ni zipi?

• Kwa moving cluster heads, fixed TSP order based only on initial positions inaweza kuwa insufficient kutoa low communication cost.
• Kwa fixed visit order, vector-field method inaweza kupunguza objective function locally huku ikihifadhi route length.
• Kubadilishana route optimization na visit-order updates kulitoa large relative improvements dhidi ya initial static order.
• FinalXY ilitoa lowest cost mara nyingi zaidi among tested methods, hasa katika fast, long-route na many-target scenarios.
• FinalUV katika baadhi ya cases ilitoa performance close to FinalXY kwa fewer reorderings.
• FinalXY Greedy inaweza kuwa competitive katika small target sets kwa lower computational load.
• Kujaribu forward na reverse initial orders pamoja kunaweza kutoa better results kuliko kutegemea single initial direction.

Study haithibitishi nini?

• Haithibitishi kwamba routes zilizopatikana ni globally best among all possible routes.
• Haionyeshi kwamba transmission energy itapungua kwa same proportion kwenye real sensor hardware.
• Haitoi field test ya algorithm kwa real drone, radio module au moving sensor.
• Haionyeshi safe flight katika obstacle-filled, windy au three-dimensional environments.
• Haionyeshi kwamba same performance itadumishwa targets zinapobadilisha speed na direction katika complex movement.
• Haipimi robustness kwa position-measurement errors, communication outages na packet loss.
• Haitathmini flight-dynamics constraints kama turn angle, acceleration, maximum bank angle au minimum turn radius.
• Haijaribu kwa numerical experiments option ya minimizing maximum individual cluster-head energy kati ya optimization objectives mbili.

Strengths za study ni zipi?

Main strength ya study ni kuingiza directly moving-target positions at arrival time kwenye objective function. Hivyo target motion inashughulikiwa kama sehemu ya mathematical structure ya problem, si post-processing step independent of route optimization.

Differential equation inayohifadhi route-length constraint ndani ya vector field inatoa continuous improvement direction badala ya kusolve independently constrained optimization problem katika kila numerical step. Gradients za objective function na route constraint zimetolewa kwa detail katika study.

Six scenario classes zinajaribu kutenganisha effects za target speed, target count na route budget. Kutumia samples 100 kwa kila scenario kunazuia results kutegemea single random layout. Kushiriki code katika open GitHub repository pia kunaunga mkono reproducibility.

Main methodological limitations ni zipi?

• Optimization method hutoa local minimum kwa fixed order; hakuna global-optimum guarantee.
• Visit order inabainishwa kwa comparison ya several heuristic methods, si exact integrated optimization.
• Energy objective function haina physical units wala real radio-hardware coefficients.
• Cluster heads zimemodeliwa kwenye two-dimensional plane kwa constant-speed linear motion.
• Own energy consumption ya drone imewakilishwa tu na route length.
• Wakati wa transmission drone inachukuliwa stationary au motion yake negligible.
• Ingawa route-length problem initially defined kama \(g\leq L\), vector-field implementation inaoperate kwenye equality surface \(g=L\).
• Value \(t_m=L/s_d\) inayotumika kwa initial TSP order inaitwa “mid-time”; hata hivyo value hii ni sawa na total route duration.
• Number of methods katika baadhi ya text sections imeelezwa kama “eight” au katika code description “six”, huku Figure 11 ikionyesha ten forward/reverse methods.
• Real-time claim inategemea desktop simulation runtime pekee.
• Hakuna physical field experiment, independent reimplementation au broad benchmark comparison na other routing algorithms.

Ni validations zipi zinapaswa kufanywa baadaye?

Method kwanza inapaswa kucalibrateiwa na energy consumption ya real radio transmitters kulingana na distance, power level, data amount na packet-delivery ratio. Distance exponent katika objective function inapaswa kubadilishwa kwa measured channel loss na communication-protocol values.

Kisha obstacles, three-dimensional altitude, wind, maximum speed, acceleration, turn radius, safe distance na airspace boundaries ziongezwe. Scenarios ambapo targets zinabadilisha direction, position measurements zinachelewa au zina errors, na data link inakatika zinapaswa kujaribiwa separately.

Performance ya FinalXY, FinalUV na greedy methods inapaswa kulinganishwa chini ya same datasets na same computational budget na other dynamic TSP, model-predictive control, metaheuristic na mixed-integer optimization approaches. More initial orders na global lower bounds zinapaswa kutumika kupima local-minimum dependence.

Mbinu na Matokeo ya Utafiti

Non-experimental engineering validation

Study hutumia mathematical model na computer simulation badala ya physical experiment. Katika kila Monte Carlo sample, initial positions na speeds za cluster heads zinagenerateiwa upya, all methods zinaendeshwa kwenye same sample na objective value, runtime na reordering count zinalinganishwa.

Six simulation scenarios

Compared route-ordering methods

Summary of main findings

Correct interpretation of results

“Yüzde 90 improvement” haimaanishi kwamba optimized solution inaongeza real sensor battery life kwa yüzde 90. Inaonyesha relative difference kati ya distance-based objective value katika initial TSP order na optimized objective value.

Vilevile “best method” haipaswi kumaanisha method inayopata global optimum mathematically among all possible routes. FinalXY ndiyo method iliyopata lowest objective value mara nyingi zaidi among tested algorithms na initial solutions.

“Real-time” result pia inarejelea route computation kukamilika ndani ya seconds kwenye desktop computer iliyotumika, si end-to-end latency ya field system.

Code structure na reproducibility

Kushiriki source code kunarahisisha reimplementation. Hata hivyo, study haitoi specific software-version file, dependency lock, random seeds au independent reproduction report. Kwa hiyo code availability peke yake haihakikishi kwamba reported results zote zitarudiwa identically kwenye system nyingine.

Dokezo la Chanzo na Mbinu

Study hii ni SSRN preprint ambayo publication yake katika peer-reviewed journal haijathibitishwa. Results zinapaswa kutathminiwa kwa kuzingatia limitation hii. DOI inatambua SSRN study record na haipaswi kuwasilishwa kama DOI ya peer-reviewed journal article.

Scientific content ya Verianla article hii imeandaliwa kwa kutegemea uploaded study pekee. External sources zilitumika tu kuthibitisha bibliographic identity information kama study title, authors, institutional affiliation, SSRN record, DOI, upload date na official links. Hakuna external experimental result au additional scientific performance data isiyokuwepo katika study iliyoongezwa.

Main conclusion ya research ni kwamba kwa moving targets, jointly and iteratively updating route geometry na visit order kunaweza kupunguza distance-based communication cost kwa kiasi kikubwa relative to initial static TSP order. Hata hivyo result hii imewekewa kikomo na idealized simulation environment yenye two-dimensional, constant-speed, obstacle-free motion na complete position information.

Results hazipaswi kutafsiriwa kama real battery life, energy in joules, safe flight, field communication reliability au legal operability. Validation kwa independent implementation, physical drone na sensor experiments, na real channel na flight dynamics inahitajika.