代写MTRN4010、代做MATLAB程序设计

项目预算：开发周期：发布时间：要求地区：

MTRN4010 –T1/2024 PROJECT 1
1
MTRN4010/2024 - PROJECT #1
Part A - Dead reckoning localization.
Part B - Basic processing of LiDAR scans / Mapping
LiDAR scans in the global coordinate frame. OOIs
detection.
Part C - Data association.
Part D - Applying sporadic deterministic localization: Mapbased Localization).
Part E- Applying deterministic permanent localization:
sensor data fusion via state observer.
Introduction:
This project is composed of five parts (modules). Those modules are intended to jointly
operate for allowing the platform (vehicle) to infer its surrounding context and to
continuously estimate its heading and its 2D position (i.e., to perform localization). The
sensors used to feed the processing modules are speed sensor, gyroscope, and LiDAR.
We solve the project gradually, by designing, implementing, and testing the individual
modules. Those are then integrated for implementing the full system.
In this project our solution is based on deterministic approaches, in which we apply
concepts we know from previous courses (e.g., from Math and MMAN3200) and some
other approaches we learn in MTRN4010 (e.g., optimization). Later, in Project 2 we will
extend these concepts by applying Stochastic Sensor Data Fusion.
The following section is a brief description of the project parts. In subsequent sections a
detailed description is available; in which the requirements and the marking criteria of
those project parts are given in detail.
Part A requires implementing a dead-reckoning process. This process generates
predictions of the platform’s pose, based on a kinematic model whose inputs are fed by
measurements from a speed sensor and a from an IMU gyroscope. Your program will
keep performing predictions of the platform’s poses during the full duration of the test by
properly applying the kinematic model.
Your module will operate in a “real-time” fashion, being called from the “Events loop” at
each event, always considering the elapsed time since the last previous event (“dt”).
You may adapt one of the provided example programs that we have released for
solving problem 4 in the tutorial work of week 2.
MTRN4010 –T1/2024 PROJECT 1
2
In addition, it is essential to periodically record the estimates of the platform's pose at a
specified sampling rate. These recordings should be stored in a buffer and plotted at the
end of the playback session. This enables you to evaluate the accuracy of your results.
In addition to the previously mentioned capabilities, your module must allow the user to
define certain parameters: an offset for manually compensating gyroscope bias and a
gain to allow calibrating the speed sensor. A detailed description of Part A is in the
section about detailed descriptions.
Part B
Feature extraction. In this section you are required to process LiDAR scans for inferring
the presence of “Objects of Interest” (OOIs), which for us are those objects that seem to
be navigation landmarks.
Each time a new LiDAR scan is available (at a “LiDAR event”) your module will perform
the following processing:
1) “Clustering” (a.k.a. “segmentation”). You will process the raw scan to obtain a list
of clusters and select those that seem to be OOIs.
2) Visualization in LiDAR1’s CF (in Cartesian representation), of all the scan points
and the centers of the detected OOIs.
(note: you are not required to do it for scans from LiDAR2)
3) Visualization in GCF of all the scan points and the OOIs centers.
(you will use the same figure already being used for part A)
In this case, you are required to perform this processing and visualization for
scans from both LiDAR sensors.
For the transformation to GCF you will use the estimates of the platform’s pose
that you obtain from the module implemented for part A.
If that module seems to be operating unsatisfactorily, you will use Ground Truth
poses, to verify the consistency of your Module B.
This means that at each LiDAR event your module will process the arrived
measurement (i.e., a LiDAR scan) for performing the processing required in subitems 1-
3. In some of them you may also need to use the current pose estimates which are
maintained and provided by module A (which means that Module-A must be enabled in
the events loop.)
Keep in mind that we specify upper limits for the processing time required by your
module, so that inefficient implementations may lose marks. We give details about how
to measure processing times (see appendix section “Measuring processing time”).
Part C Data Association
MTRN4010 –T1/2024 PROJECT 1
3
This module focuses on performing “Data Association” (“DA”. For this to be feasible,
part A and part B need to be successfully working before attempting part C.
DA is necessary for other modules of the project (D and E). Performance of your DA
processing is demonstrated visually, for which you will implement some dynamic plots.
Your module must be able to deal with missing detected poles (“false negatives”) and
with unexpected poles (“false positives”), those may occur due to sensor limitations,
occlusions, presence of intruders in the area of operation, incompletely surveyed maps,
etc. Refer to section “Data Association” in the appendix, for more details.
Part D requires implementing a classic approach for localization, based on processing
measurements from sensors such as the LiDAR, and on exploiting a navigation map
(map of known/surveyed landmarks). The concept about localization based on a map of
landmarks is similar to that of the GPS example, discussed in Lecture 3. However, in
our case, we use a LiDAR to detect navigation landmarks and to measure their
positions in the local CF of the sensors (in place to measuring distances to visible
satellites). Your work in tutorial 3, may help in this matter.
In this part of the project, you will be free to decide how to solve the task, which may
require solving a set of equations, for which your knowledge of Mathematics may be
sufficient. Alternatively, you may apply optimization (discussed in lecture 3), or other
approaches you may know from other courses. This module must be able to generate
pose estimates at LiDAR events in which enough useful OOIs are available. Part D is
based on the outputs of modules B and C (but not of A directly). If in certain areas of
operation, the information provided by B and C is not sufficient, your module will report
“no solution”, via a flag which is intended to indicate existence (or not) of solution at that
time. (For that reason, we used the term “sporadic localization”, as we cannot assume it
would be permanently available.)
Part E requires the implementation of a deterministic observer, for fusing, in real-time,
all the sources of information that we have (i.e., sensors’ measurements and models
and/or outputs of any of the other modules) for achieving permanent vehicle
localization. You decide which sources of information and how to exploit those. The
state observer will be like those you used in MMAN3200; however, our problem here
cannot be solved directly using that LTI oriented approach, but a similar one. Module E
should make good use of the outputs generated by Module D. Ideas about how to
propose this state observer will be briefly discussed in lecture time. We say that it is
“permanently available” because this observer would be able to provide, nominally,
estimates at any required time.
Details about the required solutions for A, B, C, D and E can be found in the extended
description, included in this document.
Deadline for submission, of the full project, is Friday Week 5, 23:55 + 2 days.
Submission will be via Moodle. Details about how your program files must be organized
(names, author details) are specified in an extra document, to be released in week 3.
MTRN4010 –T1/2024 PROJECT 1
4
Marking criteria
Project 1, if 100% successfully completed, provides 23 points of the course final mark.
In addition to the submission of your implementation, you need to explain and show, to
a member of the teaching staff, how your submitted program does perform. Both
submission and demonstration are necessary conditions. A project which is not
submitted, or that is not demonstrated, will get no marks.
The demonstration will take place during week 7, in your weekly lab_tut session. It will
be based on the submitted material (which is to be kept, securely, in the Moodle
submission repository). Other versions of your solution that you may produce cannot be
used in the demonstration.
Note: students who are enrolled in a session that runs on Friday will be offered an
alternative day (as Friday on Week 7 is holiday)
Your finally achieved project mark depends on the performance of your implementation
and on the demonstration of the project, and on a “knowledge factor” about the project
(variable Q in the marking equation, below).
The relevance of the implementation and demonstration of the project parts is as
follows:
Part A: 18% (of the project mark, i.e.,0.18*23 marks)
Part B: 21%; Part C: 19%
Part D: 21%; Part E: 21%
The addition of the values obtained in each part is the “Submitted and Demonstrated
Project Mark”. The factor Q, which is used for calculating the final mark of Project 1, is
obtained based on your performance answering questions, during the demonstration,
and/or via a quiz if needed. Factor Q is represented in scale [0:100]
The influence of Q on the overall project mark can be seen in the following formula.
Overall Project Mark = [Submitted and Demonstrated Project Mark] *
(0.6+0.4*Q/100)
For instance, if you fail in answering all the questions, your Q factor will be 0, which
means you would get 60% of the achieved marks of your submitted/demonstrated
programs.
Questions/doubts: Ask us via Teams Forum, or by emailing the lecturer
(j.guivant@unsw.edu.au)
MTRN4010 –T1/2024 PROJECT 1
5
Detailed Specifications and detailed marking criteria.
The modules that you will implement for solving the five parts of this project, are
expected to work in simulated real time (from a data playback session). The modules
are called from the individual iterations of the “events loop”, during playback sessions.
The “event loop” was introduced during week 2, for solving one problem of the tutorial
work (Problem 4).
You were required to prepare for this project by solving those tutorial problems. We
assume that at the time you are reading this document, you have already been working
on those tutorial problems. In addition, the example programs that have been provided
for week 2 tutorial work can be modified by you, for implementing your project 1 without
needing to start from scratch.
Part A – Localization based on Dead reckoning
estimation of the vehicle position and heading.
Implement a module for estimating the platform pose, based on a kinematic model, and
on the measurements of the speed (longitudinal velocity) and the heading rate (from
gyroscope).
This process will be called from the events loop, at each sensor event, always being
fed with the last updated values of speed and gyro measurements, and by using a “dt”
equal to the elapsed time since last processed event. You will always generate
estimates of the platform’s pose, at each event.
In addition to maintaining the estimates of the platform’s pose, you will record those
estimates in a buffer defined by you for that purpose (this is like what we have done for
solving some tutorial problems during weeks 1 and 2). However, you will record the
values of those estimates only at the times of the LiDAR events.
Based on those recorded samples, you will be able to validate your results (accuracy of
your estimates/predictions) by comparing your estimated trajectory with that of the
provided ground truth (GT).
At the end of the playback session, you will calculate the errors between your estimated
trajectory and that of the GT, and then you will plot those discrepancies in a separate
figure.
You will also plot the recorded positions in a figure dedicated to show information in the
Global coordinate Frame (GCF). That figure may be the one produced in one of the
example programs. You may reuse that capability of the example program.
MTRN4010 –T1/2024 PROJECT 1
6
Marking criteria for part A.
We will verify the accuracy of your solution for part A, when used with a “noise-free”
dataset (such as “aDataUsr_007b.mat”). We will consider how your program performs
during the full trip.
The contributions to the marks of Part A (expressed as % of Part A), are the following:
Item 1 (35%). Accuracy, in terms of position of your estimates, when compared to the
GT. The discrepancy must be lower than 2 cm, always (full trip).
Item 2 (30%). Accuracy, in terms of heading, of your estimates, when compared to
those of the ground truth. The absolute value of the discrepancy must be lower than 1
degree, always.
For the purpose of inspecting the performance of the estimates for evaluating items A1
and A2, you will plot the discrepancy in position and in heading, between ground truth
and your pose estimates. You will plot those discrepancies in a figure. One subfigure
(using subplot) for showing discrepancy in position
( ) ( ) estimated GT position i position i −
against index i. A second subfigure will be used for showing the absolute value of the
discrepancy in heading estimates, plotting
( ) ( ) estimated GT heading i heading i − in degrees.
Item 3 (15%): Functioning capability for allowing users to manually set the speed sensor
gain and the gyro offset.
Item 4 (20 %). Visualization in Global CF.
Required features (for item 4):
F1) Before the events loop starts: Static features (Map of walls and poles),
F2) after the events loop is completed, you will the recorded estimated path.
F3) Dynamic plot: Estimated current pose of the platform (position and
heading), animated dynamically, at the rate of the LiDAR events (you may use the API
function for that purpose, if you want).
F4) Dynamic plot: Actual current pose of the platform (GT position and
heading), animated dynamically, at the refresh rate used in F3.
These features (F1 to F4) are relatively simple, for that reason each of those items will
be considered accepted ONLY if it is “free of glitches”. Rejected features will result in a
mark reduction of 10%.
This means that if all features are accepted, the mark will be markA3=20%. If one
feature were not accepted (but the rest were ok), then item3 would have a mark
markA3=20-10=10%. In the worst case markA3 would be restricted to be=0 (i.e., would
not turn to be negative).
Inefficient (e.g. too slow brute force) visualizations will not be accepted as “free of
glitches”. Consult the leading demonstrator in your session, to have a brief look at your
results (e.g. during week 4).
MTRN4010 –T1/2024 PROJECT 1
7
Visualization updates must be performed ONLY at the LiDAR events, even if you are
not processing LiDAR data.
Part B –Processing LIDAR data. Mapping from local
to global CF. Detection of OOIs (Objects of Interest).
Implement a module for processing individual scans, for detecting certain types of
objects (from the raw measurements provided by the sensors).
This processing will be performed at each LiDAR event.
Part B is divided into subsections (B1, B2, B3), which are described here.
B1) For each LiDAR scan, parse (decode) the data to extract ranges and intensities.
In addition, express the scan points in cartesian coordinate frame.
For those scans from LIDAR1, in a figure representing LiDAR1’s CF, show dynamically
all the scan points, in Cartesian. In the same figure, show using a different color, the
points that do have high reflectivity.
You are NOT required to implement similar visualization for scans generated by
LiDAR2.
B2) At each LiDAR event, detect objects of interest. We consider as OOI any object that
seems to be a reflective pole, i.e., that has a defined size (apparent diameter smaller
than 20cm), and that it appears not to be opaque (i.e., at least one of the pixels that
constitute that cluster is highly reflective).
Refer to appendix sections “LiDAR scans” and “OOIs / Landmarks” for more details.
A LiDAR scan usually captures multiple clusters of points, being some of them
associated to our OOIs/landmarks (which are small, i.e., are poles having diameters
lower than 20cm). In addition to considering the apparent size of a cluster of points, for
the sake of increasing certainty, you will need to verify that the cluster is “sufficiently
brilliant”. If that condition is satisfied, you will consider that cluster to be an OOI (i.e., a
potential map landmark). For each segment (cluster of points) that seems to compose
an OOI, you need to estimate its center of geometry (CoG) and three other properties.
The output of your function will include a list with the positions of CoGs of the detected
OOIs, in that scan. Those CoGs are expressed in Cartesian representation, in the
LiDAR’s coordinate frame. The additional features of the cluster are its approximate
diameter, its brilliance (% of that cluster’s pixels that are highly reflective) and the
number of points that constitute that cluster.
You can solve this part of the project by implementing your approach from scratch, or by
exploiting the provided API, or by using a third-party implementation. If you use a thirdparty solution, you will need to clearly indicate the source of that tool, and that source
MTRN4010 –T1/2024 PROJECT 1
8
must be unrelated to UNSW. This item is required to process a LiDAR scan, in less
than 10 milliseconds, in a PC such as those in Lab212/213). That processing time
excludes any extra time for refreshing plots when you test your solution. Read the
appendix section “Measuring processing time” for details about the way to measure
elapsed times.
Solutions that frequently take more than 10ms to process this task will be considered
inadequate, consequently losing 50% of the marks of this part due to that lack of
compliance. This processing time specification is for the lab computers (L212/213).
This processing time considers the time consumed for the inference of all the OOI in a
LiDAR scan. It does not include the processing time spent for plotting or any other
visualization of the results.
B3) Extra visualization capabilities.
B3.1) Information to be shown in LiDAR1 CF (in Cartesian: Centers of detected OOIs
inferred from LiDAR1 scan. This item must share the figure defined and used in B1.
B3.2) Information to be shown in Global CF
1) All OOIs items (from LiDAR1 and LiDAR2) detected in item B1, expressed in
GCF (you choose the style).
2) LiDAR1 scan points, expressed in GCF (use blue dots).
3) LiDAR2 scan points, expressed in GCF (use green dots).
In addition, to those requirements (in B1, B2 and B3), the total processing time for
treating the LiDAR event, including all required visualization, must take less than 40ms.
Marking criteria for part B.
Contributions to the marks of Part B (expressed as % of Part B)
Item B1 (05%). This item must be free of glitches. It can be mostly based on the
provided examples.
Item B2 (80%). OOI detection efficacy. By visual inspection, at certain times during the
playback session, the demonstrator will inspect the results of your OOI detector, to
verify if those OOIs you obtain are mostly consistent with the raw scans. The
demonstrator will consider two rules. Rule 1: The positions of the generated OOIs
centers must be close enough to those clusters of raw points that common-sense
dictates. Rule 2: Evident segments/clusters of points, in the raw scans, that seem to be
OOI (from common sense), must be detected to be OOIs. Few and sporadic misses will
be ignored by the demonstrator. The demonstrator will pause your program at certain
times to inspect the information you show in the local CF (from item B3). This
MTRN4010 –T1/2024 PROJECT 1
9
procedure will be repeated at least four times; based on that, the demonstrator and you
will get a ratio of success (“k”). The mark for your part B1 will be markB1 = 80*k/100.
Item B3 (15%). Visualization. This capability is necessary for showing results. It is
composed of two subitems (B3.1 and B3.2), having relevance 7.5% (of B) each one.
These items must be free of glitches to be accepted. If item B3.1 is not working, your
part B2 will not be marked.
We specify an upper limit on the computation time of the LiDAR processing. The spent
time for the data processing must be less than 15ms. The limit to the total processing
time (which includes visualization operations as well) is defined to be 50ms.
If any of those limits is frequently exceeded, a penalty will be applied: 50%-mark
reduction.
Part C – Data Association
Implement the capability to perform Data Association (DA) between OOIs (detected by
module B) and Landmarks from the navigation map.
When we detect a set of OOIs, we need to infer which ones of those seem to
correspond to landmarks of the navigation map. For obtaining that correspondence we
perform a DA process. You are required to implement a basic DA module and to apply
it to the OOIs detected by module B. Read appendix section “Data Association” for
details.
In addition to the DA implementation, certain visualization resources will be
implemented, as part of the requirement in this section. In the figure associated to the
global CF (the figure also used in parts A and B), you will include some graphic
capabilities for showing the set of matched pairs, {OOI / Landmark}, in GCF. You may
use (free of penalties) some helper function, from the provided API, for that purpose, or
implement your own visualization of associated pairs.
The lecturer will show his DA approach working in videos and will also show details
about how to use the helper function. You may like to use that way, or you may try other
ways to clearly show, dynamically, the DA results. In any case, DA visualization must be
free-of-glitches.
The performance of you DA implementation will be evaluated in terms of apparent % of
success. For that purpose, you (and us) will apply a visual verification, based on your
visualization module.
The test of your DA solution will be performed under adverse conditions, in which OOIs
(in GCF) and landmarks will not match well. For that purpose, we will exploit the
capability of your Module A to add an offset to the gyroscope measurements, resulting
in a gradually increasing drift in the pose estimates. Your DA process must work until
the discrepancies between OOIs and Landmarks do exceed certain tolerance (1m)
If your DA visualization module were not properly working, you would not be able to
show your DA results and, consequently, no marks would be awarded to it.
MTRN4010 –T1/2024 PROJECT 1
10
Marking criteria for this part.
Item C.1 (20%). Visualization of results from DA. In the figure related to the GCF, in
which you dynamically show all OOIs and statically show Landmarks, you will also show
the set of associated couples {OOI/Landmark} (that resulted from your DA process),
indicating each associated couple, so that users can appreciate those associations.
This component must be free-of-glitches, and it will be accepted only if you have also
implemented the actual DA process (C.2).
If item C.1 does not work, you will not be able to show item C.2.
Item C.2 (80%). Efficacy of the DA process. The demonstrator can stop your program at
several times during the demo to inspect the DA performance.
The demonstrator will pause your program at least three (3) times throughout the whole
simulation. We will count the number of successful and the number of missing DA pairs.
A factor k = [ number of successful DA matches / total number of evident matches] will
be evaluated. The mark assigned to this item will be 80*k.
The evaluation will be performed in realistic conditions, in which the estimates of Part A
would not be so good (We will achieve that by simulating a small bias in the gyroscope
measurements).
We specify an upper limit on the computation time of the DA. The spent time for the DA
processing must be less than 5ms. The limit to the total processing time (which includes
visualization operations as well) is defined to be 20ms.
If any of those limits is frequently exceeded, a penalty will be applied: 50%-mark
reduction.
Part D – Sporadic Deterministic localization
Based on the detected OOIs that have been associated to Landmarks (we refer to those
OOIs as useful OOIs), Module D will estimate the platform pose just based on the local
positions of the useful OOIs, and on the positions of their associated landmarks.
You decide the approach for solving this problem.
You must provide estimates only when you have 3 or more useful OOIs.
Record (in a buffer) the estimated pose. If you have fewer than 3 useful OOIs, you will
record the flag value [0;0;0] (no solution). You may try accepting just 2 useful OOIs, but
we do not require it.
The relevant part of the processing for implementing this module must be encapsulated
in function named EstimatePoseD, whose syntax must be:
[epose, valid] = EstimatePoseD( Useful_OOIs, AssociatedLandmarks,
extraParemeters);
In which epose is the result of your calculation, and valid is a flag. If a valid solution is
generated, then epose will contain that solution, and the flag valid will be =1. I no
solution is generated, then you will return epose = [0;0;0] and valid=0.
The input arguments are:
MTRN4010 –T1/2024 PROJECT 1
11
Useful_OOIs : list of useful OOIs
AssociatedLandmarks: List of landmarks matched to the list of useful OOIs.
extraParemeters: Any parameters you may need in your calculations.
You may animate this estimated pose in the same way you did for showing GT and
Kinematic based estimates.
Marking criteria for this part.
Item 1 (05%) After the end of the events loops, plot, in a separate figure, the
discrepancies between estimates and ground truth, for all LiDAR events, in terms of
position and in term of heading.
Item 2 (25%). Based on the plots presented in item 1, discrepancies in position must be
lower than 20cm.
Item 3 (25%). Based on the plots presented in item 1, discrepancies in heading must be
lower than 3 degrees.
Item 4 (20%). The processing time of your pose estimator must be lower than 8ms.
Item 5 (20%). Brief report (up to 3 pages), describing your approach.
We specify an upper limit on the computation time of Module D. The computation time
must be less than 60ms. If this limit is frequently exceeded, a penalty will be applied:
50%-mark reduction.
Part E – Permanent Deterministic localization
Based on the available results from the rest of the modules, implement a state observer,
for estimating the platform pose.
This estimator must operate adequately, even under the presence of noise in
measurements, including a small bias in the gyro measurements.
Your observer must have a structure like those classic observers seen in MMA3200, in
the sense that the observer will exploit the state equation (our kinematic model), and
also a correction term. You will propose and implement this state observer.
Estimates of this observer are required to have discrepancies (respect to GT pose)
lower than 3 cm in position, and 3 degrees in heading, always, even under presence of
disturbances such as a small gyroscope bias (e.g. conditions under which an open loop
estimator would fail).
The marking criteria of this part will be mostly focused on the performance of your
solution and on a brief report (page limit = 2) in which you will explain your approach.
Details about the conditions under which your solution must achieve those accuracy
specifications will be released on Monday week 4, jointly with details about the required
report format.
MTRN4010 –T1/2024 PROJECT 1
12
APPENDIX
Using datasets via API
We test out implementations via playback sessions, in which we read sensors’
measurements following the same timing in which those had occurred. In a playback
session we are reading the data (measurements) which had been previously recorded
in experiments or in simulations.
As we may have multiple experiments, we encapsulate them in individual datasets.
Thus, we can test our solution using any dataset we want, to recreate what would have
happened if our solution had been used during that experiment, in real-time.
The API offers functions to access datasets, such as a function for selecting/opening a
dataset, and a function for chronologically reading measurements of the currently
selected dataset, and a few more useful functions, called helper functions, to simplify
our implementations for solving the projects. You are expected to read the example
programs offered with the release of this project, and also with the example program
you used for solving problem 4 in tutorial 2.
Definition: “Free of glitches”
In our project, we require certain items to be implemented “free of glitches”. That is
required when the complexity of the item is sufficiently low, and for which the student is
assumed to have good skills and knowledge for solving it. In addition, these items are
usually critical and strictly necessary for allowing to solve other project parts; and these
items must work well for those purposes. These items do provide marks to the overall
project mark, and they are usually marked as OK (accepted) or not OK (not accepted),
not allowing partial marking. Failure to solve these items may result in not being able to
solve or to show the operation of other project items.
Typical examples of this type of item are those related to visualization of results and
which are usually based on provided example code.
Serious sources
For certain parts of the project, in we explicitly mention that you are allowed to use
resources which are offered by third parties, publicly, e.g., from MATLAB or other
repositories (e.g. GitHub) or papers. If you do that, you always need to mention, in your
code, the source of the tool/resource that you are using. In addition, you would mention
the purpose of using it. You are not allowed to use pieces of code from other students in
the course this year or from previous years.
LiDAR scan
A LiDAR sensor provides measurements in the form of scans. A scan is composed by a
set of individual range/intensity measurements, in which each of them is associated to
an azimuth angle. In our case, LiDARs do scan from [-75 to +75 degrees, azimuthally, in
steps of 0.5 degrees. Due to that, the image taken by the LIDAR is composed by 301
ranges that are associated to 301 consecutive angles. In addition to the distance
(range), the individual measurement provides information about the intensity of the
MTRN4010 –T1/2024 PROJECT 1
13
reflection, which can be associated to the reflectivity of the reflecting surface. In our
programs, the measurements are provided as arrays of 301 uint16 integers. Of the 16
bits, the range is given by the lowest 14 bits, and the intensity (of the reflection) is given
by the highest 2 bits. Range is expressed in cm. Intensity is used in relative terms. We
consider that a surface, at the measured spot, is “not opaque” if its measured intensity
is higher than zero. Usual surfaces are opaque; poles used as landmarks are covered
with a reflective layer, so that readings from those surfaces usually appear with high
reflection intensity. In some of the provided examples we show that property in our
dynamic plots.