Approximate Path Searching Method for Single-Satellite Observation and Transmission Task Planning Problem

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2017/7304506/figures/7304506.fig.009a.svgz" name="7304506.fig.009a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Regional city data set</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2017/7304506/figures/7304506.fig.009b.svgz" name="7304506.fig.009b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Global city data set</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/mpe/volume-2017/7304506/figures/7304506.fig.009c.svgz" name="7304506.fig.009c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Global point data set</td></tr></table>

<div>The average benefit of LS under the combinations of relaxation factors.</div>

Mathematical Problems in Engineering

fig9

Figure 9

Figure 9: Approximate Path Searching Method for Single-Satellite Observation and Transmission Task Planning Problem 